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:
# your code goes here
t=int(input())
for i in range(t):
	n,s = input().split(' ')
	tmp= int(n)
	n= str(n)
	s= int(s)
	ar = [0]
	m = len(n)
	for j in range(m):
		ar.append(ar[-1] + ord(n[j]) - ord('0'))
	if(ar[-1]<=s):
		print(0)
		continue
	check= False
	for j in range(len(ar)-1, 0,-1):
		if ar[j]+1 <=s:
			ans=0
			cur=10
			for t in range(j+1,m):
				cur*=10
			ans = cur*(ord(n[j-1]) - ord('0')+1)
			for t in range(j-1,0,-1):
				cur = cur*10
				ans = ans +  (ord(n[t-1]) - ord('0'))*cur
			print(ans-tmp)
			check = True
			break
	if check:
		continue
	ans=1
	for j in range(m):
		ans*=10
	print(ans-tmp)