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 func(x, y):
    res = 1
    while y:
        if y%2:
            res *= x
        y //= 2
        x *= x
    return res

for _ in range(int(input())):
    n, s = map(int, input().split())
    k = n
    ans, S, j, V = 0, 0, 0, []
    while k:
        V.append(k%10)
        S += k%10
        k //= 10
    while S>s and j<len(V):
        if V[j] != 0:
            S -= (V[j]-1)
            ans += (10-V[j])*func(10,j)
            if j<len(V)-1:
                V[j+1] += 1
        j += 1
    print(ans)