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:
# map(int, input().split())
rw = int(input())
for wewq in range(rw):
    n, s = map(int, input().split())
    p = list(map(int, list(str(n))))
    ps = 0
    for i in p:
        ps += i
    p.reverse()
    if ps <= s:
        print(0)
        continue
    for i in range(len(p)):
        ps -= p[i]
        p[i] = 0
        k9 = 0
        j = i
        while j < len(p) and p[j] == 9:
            j += 1
            k9 += 1
        if ps + 1 <= s or ps + 1 <= s - k9 * 9:
            if i == len(p) - 1:
                p = p + [1]
            else:
                p[i + 1] += 1
            break
    for i in range(len(p)):
        if p[i] == 10:
            p[i] = 0
            if i == len(p) - 1:
                p = p + [1]
            else:
                p[i + 1] += 1
    a = ''
    p.reverse()
    for i in p:
        a += str(i)
    print(int(a) - n)