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 = input()
for t in range(int(T)):
	r=input()
	# print(r)
	r=r.split(' ')
	n=int(r[0])
	s=int(r[1])
	# print(n,s)
	digits=[]
	sum=0
	m=n
	while(m>0):
		sum += m%10;
		digits.append(m%10);
		m=m//10;
	# print(sum,s)
	digits.reverse()
	if sum<=s:
		print(0)
	else:
		# print(1)
		p=len(digits)
		ans = 10**p - n
		v=0
		for i in range(p):
			v = v + digits[i]*(10**(p-i-1));
			val = v + (10**(p-i-1))
			digit_sum = 0
			c = val
			while(c>0):
				digit_sum += c%10;
				c=c//10;

			# print(digit_sum,s,digit_sum<=s)
			if digit_sum<=s:
				# print("hello")
				if ans>(val-n):
					# print(val-n)
					ans = val-n
		print(ans)