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:
q = int(input())
while q:
    n, s = map(int, input().split())
    tmp = str(n)
    res, ans = [], 0
    for i in reversed(tmp):
        res.append(int(i))
    carry = 1
    idx = 0
    while sum(res) > s:
        if res[idx] == 0:
            carry *= 10
            idx += 1
            continue
        d = 10 - res[idx]
        ans += carry * d
        carry *= 10
        res[idx] = 0
        idx += 1
        if idx < len(res):
            res[idx] += 1
        else:
            res.append(1)
        t = idx
        while res[t] >= 10:
            x, y = res[t] % 10, res[t] // 10
            if t >= len(res) - 1:
                res.append(y)
            else:
                res[t + 1] += 1
            res[t] = x
            t += 1
    print(ans)
    q -= 1