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 fun2(s,n):
	ans = 0
	for i in range(n):
		ans+=ord(s[i])-48
	return ans


def fun(s,n,x):
    #print(s,n,x)

    for i in reversed(range(1,n)):
        #print(i)
        s2 = s[0:i]
        temp = fun2(s2,i)
        #print(s2,s[i:n],i)
        if(temp<x):

            temp2 = int(s[i:n])
            #print(temp2)
			#cout<<temp2<<" "<<pow(10,(n-i))-temp2<<"     hhhhh\n";
            return 10**(n-i)-temp2
    temp2 = int(s)
    temp3 = 10**n

	#cout<<" g "<<temp2<<"\n";
    return temp3-temp2


t = int(input())
while(t>0):
    t-=1
    n,s = map(int,input().split())
    s2 = str(n)
    l = len(s2)
    n2 = fun2(s2,l)
    if(n2<=s):
        print(0)
    else:
        print(fun(s2,l,s))