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?
n,k = map(int, input().split())
print(n-2)
n,k = map(int, input().split())
print(n-k+1)