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 calc(n):
	ans = 0
	for i in n:
		ans += int(i)
	return ans

for nt in range(int(input())):
	n,s = input().split()
	s = int(s)
	f = calc(n)
	if f<=s:
		print (0)
		continue
	n = n[::-1]
	if n[0]=="0":
		ans = [0]
		flag = 0
		diff = f-s
	else:
		ans = [10-int(n[0])]
		flag = 1
		diff = f-s-int(n[0])

	# print (n)
	for i in range(1,len(n)):
		x = int(n[i])
		if flag:
			x += 1
			diff += 1
		if diff<=0:
			break
		# print (i,x,diff)

		if x==0:
			flag = 0
			diff -= int(n[i])
			ans.append(0)
			continue

		flag = 1
		ans.append(10-x)
		diff -= x

	new = []
	flag = 0
	for i in ans[::-1]:
		if i!=0 or (i==0 and flag):
			flag = 1
			new.append(i)
		else:
			continue


	print ("".join(map(str,new)))