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())
for testcase in range(T):
    [n, s] = [int(i) for i in input().split()]
    digits = [(n//(10**i))%10 for i in range(19)]
    newdigits = [0]*19
    if(sum(digits) <= s):
        print(0)
        continue
    count = 0
    for i in range(18, -1, -1):
        if(digits[i] < s):
            newdigits[i] = digits[i]
            s-=digits[i]
        elif(digits[i] == s):
            if(sum(digits[:i]) > 0):
                newdigits[i+1] +=1
            else:
                newdigits[i] = digits[i]
            break
        else:
            newdigits[i+1] += 1
            break
    for i in range(18):
        if(newdigits[i] >= 10):
            newdigits[i] = 0
            newdigits[i+1]+=1
    newn = 0
    for i in range(18, -1, -1):
        newn*=10
        newn+=newdigits[i]
    print(newn-n)