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:
digitsum = lambda a : sum(map(int, list(str(a))))
def list_to_int(arr):
	ret = 0
	for pow, a in enumerate(arr):
		ret += a * 10**pow
	return ret
for TC in range(int(input())):
	n, s = map(int, input().split())
	orglen = len(str(n))
	moves = idx = 0
	while 1:
		list_num = list(map(int, list(str(n))))
		if digitsum(n) <= s:
			break
		tlist = []
		for i in range(idx+1):
			tlist.append(list_num[len(list_num)-i-1])
		if tlist.count(0) == len(tlist):
			idx += 1
			continue
		#print(tlist)
		tmp = 10**(idx+1) - list_to_int(tlist)
		n += tmp
		moves += tmp
		idx += 1
		if idx + 1 > orglen:
			break
		#print(n)
	print(moves)