There is a cricket match going on between two teams A and B.

Team B is batting second and got a target of X runs. Currently, team B has scored Y runs. Determine how many more runs Team B should score to win the match.

Note: The target score in cricket matches is one more than the number of runs scored by the team that batted first.

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

- The first line of input will contain a single integer T, denoting the number of test cases.
- Each test case consists of two space-separated integers X and Y, the target for team B and the current score of team B respectively.

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

For each test case, output how many more runs team B should score to win the match.

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

$1 ≤ T ≤ 10$
$50 ≤ Y < X ≤ 200$

----- Sample Input 1 ------ 
4
200 50
100 99
130 97
53 51

----- Sample Output 1 ------ 
150
1
33
2

----- explanation 1 ------ 
Test case $1$: The target is $200$ runs and team $B$ has already made $50$ runs. Thus, the team needs to make $200-50 = 150$ runs more, to win the match.

Test case $2$: The target is $100$ runs and team $B$ has already made $99$ runs. Thus, the team needs to make $100-99 = 1$ runs more, to win the match.

Test case $3$: The target is $130$ runs and team $B$ has already made $97$ runs. Thus, the team needs to make $130-97 = 33$ runs more, to win the match.

Test case $4$: The target is $53$ runs and team $B$ has already made $51$ runs. Thus, the team needs to make $53-51= 2$ runs more, to win the match.

Difficulty: EASY
Tags: Mathematics

Starter code:

Solutions:
for _ in range(int(input())):
	(x, y) = map(int, input().split())
	print(abs(x - y))


n = int(input())
for i in range(n):
	(k, m) = map(int, input().split())
	s = k - m
	print(s)


c = int(input())
for i in range(c):
	(a, b) = map(int, input().split(' '))
	print(a - b)


TC = int(input())
for i in range(TC):
	(x, y) = map(int, input().split())
	print(x - y)


for i in range(int(input())):
	(x, y) = map(int, input().split())
	e = x - y
	print(e)


for _ in range(int(input())):
	(x, s) = map(int, input().split())
	print(x - s)


t = int(input())
for i in range(t):
	(x, y) = map(int, input().split())
	print(x - y)


t = int(input())
for i in range(t):
	(X, Y) = [int(i) for i in input().split()]
	print(X - Y)


s = int(input())
for i in range(s):
	(a, b) = list(map(int, input().split()))
	print(a - b)


n = int(input())
for i in range(n):
	(p, q) = map(int, input().split())
	print(p - q)


t = int(input())
for i in range(t):
	(X, Y) = map(int, input().split())
	a = X - Y
	print(a)


for i in range(int(input())):
	(x, y) = map(int, input().split())
	z = x - y
	print(z)


T = int(input())
for _ in range(T):
	(X, Y) = map(int, input().split())
	print(abs(X - Y))


T = int(input())
for i in range(T):
	(X, Y) = map(int, input().split())
	print(X - Y)


T = int(input())
for i in range(T):
	(A, B) = map(int, input().split())
	print(A - B)


t = int(input())
for _ in range(t):
	(x, y) = map(int, input().split())
	res = x - y
	print(res)


a = int(input())
for i in range(a):
	(x, y) = map(int, input().split())
	print(abs(x - y))


for _ in range(int(input())):
	(a, b) = map(int, input().split())
	print(a - b)


TC = int(input())
for i in range(TC):
	(X, Y) = map(int, input().split())
	print(X - Y)


t = int(input())
res = []
for i in range(t):
	inpt = [int(x) for x in input().split()]
	a = inpt[0]
	b = inpt[1]
	res.append(a - b)
for ele in res:
	print(ele)


TC = int(input())
for T in range(TC):
	(x, y) = map(int, input().split())
	print(x - y)


t = int(input())
for _ in range(t):
	(X, Y) = map(int, input().split())
	print(X - Y)


T = int(input())
for i in range(T):
	(x, y) = map(int, input().split())
	print(x - y)


t = input()
t = int(t)
for i in range(t):
	(x, y) = input().split()
	x = int(x)
	y = int(y)
	z = x - y
	z = int(x - y)
	print(z)


t = int(input())

def cricket(t):
	x = []
	for i in range(1, t + 1):
		a = list(map(int, input().split()))
		x.append(a)
	for num in x:
		(m, n) = num
		print(m - n)
cricket(t)


def remaining_runs(X, Y):
	return X - Y
t = int(input())
for i in range(t):
	(X, Y) = map(int, input().split())
	result = remaining_runs(X, Y)
	print(result)


a = int(input())
for i in range(a):
	(s, t) = map(int, input().split())
	d = s - t
	print(d)


t = int(input())
for i in range(0, t):
	(a, b) = input().split()
	x = int(a)
	y = int(b)
	print(x - y)


n = int(input())
for i in range(n):
	(x, y) = map(int, input().split(' '))
	print(x - y)


test_cases = int(input())
for i in range(test_cases):
	scores = list(map(int, input().split()))
	print(scores[0] - scores[-1])


t = int(input())
for a in range(t):
	(x, y) = map(int, input().split())
	print(x - y)


l = []
n = int(input())
for i in range(n):
	(x, y) = map(int, input().split())
	l.append(x - y)
print(*l, sep='\n')


test = int(input())
ans = []
while test:
	test = test - 1
	(x, y) = [int(x) for x in input().split()]
	ans.append(x - y)
for i in ans:
	print(i)


n = int(input())
for i in range(n):
	(target, scored) = map(int, input().split(' '))
	required = target - scored
	print(required)


l = int(input())
for i in range(l):
	m = input().split()
	print(int(m[0]) - int(m[1]))


t = int(input())
for i in range(t):
	l = list(map(int, input().strip().split()))
	print(l[0] - l[1])


homerun = int(input())
for i in range(homerun):
	(T, B) = map(int, input().split())
	print(T - B)


for t in range(int(input())):
	(s, k) = map(int, input().split())
	print(abs(s - k))