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 getSum(n): 
    sum1=0
    while(n!=0): 
        sum1=sum1+1
        n=(n//10)
    return sum1
def getNearest(n):
    c=10-(n%10)
    c=c+n
    return c
def getSum1(n):
    sum=0
    while(n!=0):
        sum=sum+(n%10)
        n=(n//10)
    return sum
c=input()
for i in range(c):
    a,b=map(int, raw_input().split())
    res=list(map(int,str(a)))
    if(getSum1(a)<=b):
        print "0"
    else:
        e=0
        g=0
        h=0
        f=len(res)
        for i in range(f):
            e=e*10+res[i]
            h=i
            g=g+res[i]
            if(g>=b):
                break
        e=getNearest(e)
        f=f-(h+1)
        e=e*(10**f)
        e=e-a
        print e