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 PYTHON):

Solution:
def f(n):
	r = 0
	s1 = str(n)
	for c in s1:
		r += int(c)
	return r

I=lambda: map(int, raw_input().split())
t = input()
for _ in xrange(t):
	n, s = I()
	if f(n) <= s:
		print 0
		continue
	q = '0'+str(n)
	l = len(q)
	for i in xrange(l-1, -1, -1):
		w = (int(q[:i])+1)*10**(l-i)
		if f(w) <= s:
			r = w-n
			break
	print r