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.util.Arrays;
import java.util.Scanner;
 
public class Main{
		
	public static void main(String args[]){
		  
	    Scanner sc = new Scanner(System.in);
	    int N = sc.nextInt();
	    int K = sc.nextInt();
	    
	    int ans = 0; 
	    int n[] = new int[51];
	    Arrays.fill(n,0);
	  
	    for(int i = 1; i <= N; i++) {
	    	n[i] = i;
	    }
	    if(N == K) {
	    	ans = 1;
	    }else {
		    for(int i = 1; i <= N; i++) {
		    	if(n[i+K-1] != 0) {
		    		ans++;
		    	}
		    }   
	    }
	    System.out.println(ans);   
	}
}
