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:
import sys
# sys.setrecursionlimit(10**6) 
input=sys.stdin.readline
t=int(input())

for t1 in range(t):
    n,s=list(map(int,input().split(" ")))
    su=s
    z=str(n)
    z="0"+z
    o=n
    ans=0
    for i in z:
        ans+=int(i)
    w=0
    if(ans<=s):
        print(0)
    else:
        count=0
        for i in range(len(z)):
            count+=int(z[i])
            # print(count)
            if(count>=s):
                a="1"+(len(z)-i)*"0"
                a=int(a)
                org=len(z)
                n+=a
                after=len(str(n))
                if(after!=org):
                    n="0"+str(n)

                # print(i,a,n)
                x=str(n)
                x=x[:i]+"0"*(len(z)-i)
                # print(x)
                w=x
                break

        w=int(w)
        print(w-o)