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 dos(n):
    return sum(n)

for _ in range(int(input())):
    n,s=[int(i) for i in input().split()]
    a=list(map(int,str(n)))[::-1]
    a+=[0]
    ans=0
    if(dos(a)<=s):
        print(0)
        continue
    for i in range(len(a)-1):
        d=a[i];a[i]=0
        ans+=(10**i)*(10-d)
        a[i+1]+=1
        temp=dos(a)
        if(temp==s):
            #print("*",temp,a)
            break
        if(temp<s):
            dif=s-temp
            a[i]=d-dif
            break
    print(ans)