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.*;

class Main{
	public static void main(String[] args){
      	int n, k;
      	boolean loop = true;
    	Scanner sc = new Scanner(System.in);
      	n = sc.nextInt();
      	k = sc.nextInt();
      	
      	int i = 1, ans = 0;
      	while(loop){
          	int count = 0;
          	int j = i;
        	while(true){
        		//System.out.print(j);
        	  count++;
              if(j > n){
              	loop = false;
                break;
              }
              if(count == k){
              	ans++;
              	//System.out.println();
                break;
              }
              j++;
            }
          	i++;
        }
      
      	System.out.println(ans);
    }
}
