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 solve():
    s, n = [i for i in input().split()]
    n = int(n)
    i = 0
    ok = True
    while i < len(s):
        if n > int(s[i]):
            n -= int(s[i])
        else:
            ok = False
            break
        i += 1

    if ok:
        print(0)
        return

    if int(s[i]) == n:
        tmp = 0
        for char in s[i + 1:]:
            tmp += int(char)
            if tmp > 0:
                break
        if tmp == 0:
            print(0)
            return

    total = 10 ** (len(s) - i)
    cur = s[i:]
    print(int(total - int(cur)))


t = int(input())
for _ in range(t):
    solve()