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 i in range(int(input())):
    n,s=map(int,input().split())
    ls=list(str(n))
    ls1=[int(a) for a in ls]
    sm=0
    bp=1
    an1=0
    k1=1
    if sum(ls1)>s:
        for j in range(len(ls1)):
            if sm+ls1[j]<s and bp:
                sm+=ls1[j]
                dg=j
            else:
                bp=0
                an1+=ls1[j]
                k1*=10
                if j!=len(ls1)-1:
                    an1*=10
        print(k1-an1)
    else:
        print(0)