MoEngage helps the Chef send email reminders about rated contests to the participants.

There are a total of N participants on Chef’s platform, and U of them have told Chef not to send emails to them.

If so, how many participants should MoEngage send the contest emails to?

------ Input Format ------ 

- The first and only line of input will contain a single line containing two space-separated integers N (the total number of users) and U (the number of users who don't want to receive contest reminders).

------ Output Format ------ 

Output in a single line, the number of users MoEngage has to send an email to.

------ Constraints ------ 

$1 ≤ U < N ≤ 10^{5}$

----- Sample Input 1 ------ 
100 7
----- Sample Output 1 ------ 
93
----- explanation 1 ------ 
Out of $100$ users, $7$ do not want to receive reminders. Hence, MoEngage needs to send email to $93$ users.

----- Sample Input 2 ------ 
4456 342
----- Sample Output 2 ------ 
4114
----- explanation 2 ------ 
Out of $4456$ users, $342$ do not want to receive reminders. Hence MoEngage needs to send email to $4114$ users.

Difficulty: EASY

Solutions:
(n, u) = map(int, input().split())
print(n - u)


(x, y) = map(int, input().split())
print(x - y)


(N, U) = map(int, input().split())
print(N - U)


(a, b) = map(int, input().split())
print(a - b)


(x, t) = map(int, input().split())
print(x - t)


(n, m) = map(int, input().split())
print(n - m)


(n, u) = [int(x) for x in input().split()]
print(n - u)


(A, B) = map(int, input().split())
print(abs(A - B))


n = input().split()
print(int(n[0]) - int(n[1]))


(X, Y) = map(int, input().split())
print(X - Y)


(x, y) = [int(x) for x in input().split()]
z = x - y
print(z)


(N, U) = input().split()
n = int(N)
u = int(U)
print(n - u)


(j, k) = map(int, input().split())
print(j - k)


(n, u) = list(map(int, input().split()))
s = n - u
print(s)