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:
for _ in range(int(input())):
    n,s=map(int,input().split())
    lin=n
    d=[]
    su=0
    while n!=0:
        su+=n%10
        d.append(n%10)
        n//=10
    d.reverse()
    m=len(d)
    p=0
    i=0
    while i<m:
        p+=d[i]
        if p>=s:
            break
        i+=1
    a=0
    if i==0:
        a=10**(m)
    else:
        b=0
        i-=1
        j=i
        d[i]+=1
        q=1
        while i>=0:
            b+=d[i]*q
            q*=10
            i-=1
        a=b*(10**(m-j-1))
    if su<=s:
        print(0)
    else:
        print(a-lin)