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:
def su(a):
	an=0
	while(a>0):
		an+=a%10
		a=a//10;
	return an
t=int(input())
for i in range(1,t+1):
	n,s = map(int,input().split())
	if su(n)<=s:
		print("0")
		continue
	# print(su(n),"wdfegrhtf")
	ans=0
	p=1
	for i in range(18):
		dig=(n//p)%10
		ad = p*((10-dig)%10)
		ans+=ad
		n+=ad
		if (su(n)<=s):
			break
		p*=10
	print(ans)