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:
t = int(input())

for ii in range(t):
	n, s = input().split()

	s = int(s)

	start = 0

	for i in n:
		start += int(i)

	if start <= s:
		print(0)
		continue

	count = 0
	ptr = len(n)-1

	while (start >= s):
		start -= int(n[ptr])
		ptr -= 1

		if ptr < 0:
			break

	a = len(n)-1-(ptr)
	if start > s:
		print(10**(len(n)) - int(n))
		continue

	else:
		num = []

		for i in range(len(n)-1, ptr, -1):
			num.append(n[i])

		num = num[::-1]

		num = "".join(num)

		num = int(num)

		print(10**a - num)