Problem: You are given a positive integer n. In one move, you can increase n by one (i.e. make n := n + 1). Your task is to find the minimum number of moves you need to perform in order to make the sum of digits of n be less than or equal to s.

You have to answer t independent test cases.

Input

The first line of the input contains one integer t (1 ≤ t ≤ 2 ⋅ 10^4) — the number of test cases. Then t test cases follow.

The only line of the test case contains two integers n and s (1 ≤ n ≤ 10^{18}; 1 ≤ s ≤ 162).

Output

For each test case, print the answer: the minimum number of moves you need to perform in order to make the sum of digits of n be less than or equal to s.

Example

Input


5
2 1
1 1
500 4
217871987498122 10
100000000000000001 1


Output


8
0
500
2128012501878
899999999999999999

Solution (in PYTHON3):

Solution:
def sum(n):
	s = 0
	while n > 0:
		s += n%10
		n = n//10

	return s

def solve(n, s):

	ans = 0
	place = 1

	while True :

		currsum = sum(n)

		if currsum <= s:
			return ans

		r = (n%(place*10))//place
		
		# print(n, currsum, r)
		if r == 0:
			place *= 10
			continue

		n += (10-r)*place
		ans += place*(10-r)
		place *= 10
		

	return ans

# Driver
t = int(input())

while t > 0:
	t-=1

	inp = input()
	inp = inp.split(" ")
	n = int(inp[0])
	s = int(inp[1])

	ans = solve(n, s)

	print(ans)