#include<bits/stdc++.h>

using namespace std;
int main(){
	long long n,m;
	cin>>n>>m;
	cout<<n-m+1<<endl;
	return 0;
}
### Prompt

Your challenge is to write a CPP solution to the following problem:

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

### Response

```cpp
#include<bits/stdc++.h>

using namespace std;
int main(){
	long long n,m;
	cin>>n>>m;
	cout<<n-m+1<<endl;
	return 0;
}
```