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.*;
        public class Main{
          public static void main(String args[]){
            Scanner sc = new Scanner(System.in);
            
            int a = sc.nextInt();
            int b = sc.nextInt();
            int x = 0;
            
            if(a-b == 0){
              System.out.println(1);
            }else{
            x = a-b;
            System.out.println(x+1);
            }
         }
        }