Snuke has N integers: 1,2,\ldots,N. He will choose K of them and give those to Takahashi.

How many ways are there to choose K consecutive integers?

Constraints

* All values in input are integers.
* 1 \leq K \leq N \leq 50

Input

Input is given from Standard Input in the following format:


N K


Output

Print the answer.

Examples

Input

3 2


Output

2


Input

13 3


Output

11
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.Optional;

public class Main {

	public static void main(String[] args) {		

		try(BufferedReader br = new BufferedReader(new
		        InputStreamReader(System.in))) {
			String[] input = br.readLine().split("\\s");
			Optional<String> N = Optional.ofNullable(input[0]);
			Optional<String> K = Optional.ofNullable(input[1]);
			if(!K.isPresent()) {
				K = Optional.of(br.readLine());
			}
			
			int output = (Integer.parseInt(N.get()) - Integer.parseInt(K.get())) + 1;
			
			System.out.println(output);
		}catch(Exception e) {
			e.printStackTrace();
		}
	}

}
