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 dsum(n):
	tot=0;
	while(n!=0):
		tot=tot+(n%10)
		n=n/10
	return tot


t=input()
while(t>0):
	t=t-1
	l=[0,0]
	# l=input()
	# n=input()
	# m=input()
	n,m = raw_input().split(" ")
	n=int(n)
	m=int(m)
	tot=0
	n1=n
	while(n1!=0):
		tot=tot+(n1%10)
		n1=n1/10
	if(tot<=m):
		print(0)
		continue;
	k=0;
	ans=0;
	n1=n;
	while(tot>m and n1!=0):
		rem=n1%10
		ans=ans+((10-rem)*pow(10,k))
		n1=n1+(10-rem)
		tot=dsum(n1)
		k=k+1
		n1=n1/10
	print(ans)