Score : $100$ points

Problem Statement

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.

3 2

2

There are two ways to choose two consecutive integers: $(1,2)$ and $(2,3)$.

13 3

11