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:



t = int(input())
while t!=0:

    n1 ,n2 = map(str,input().split())
    n2 = int(n2)
    s = 0
    ans=0
    for i in range(len(n1)):
        if int(n1[i])+s > n2:
            t1 = int("1"+"0"*(len(n1)-i))-int(n1[i:])
            ans =t1
            break
        elif int(n1[i])+s<n2:
            s += int(n1[i])
        else:
            temp1 = "0"*(len(n1)-i-1)
            temp2 = n1[i+1:]
            if temp1==temp2:
                ans=0
                break
            else:
                t1 = int("1" + "0" * (len(n1) - i)) - int(n1[i:])
                ans = t1
                break
    print(ans)





    t-=1