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:
    q -= 1
    n, s = [int(x) for x in input().split()]
    a = list(reversed([int(str(n)[i]) for i in range(len(str(n)))]))
    price = 1
    i = 0
    ans = 0
    while sum(a) > s:
        if a[i] == 0:
            price *= 10
            i += 1
            continue
        k = 10 - a[i]
        z = a[i] - 1
        ans += k * price
        price *= 10
        a[i] = 0
        i += 1
        if i >= len(a):
            a.append(1)
        else:
            a[i] += 1
        j = i
        while a[j] >= 10:
            c = a[j] % 10
            d = a[j] // 10
            if j + 1 >= len(a):
                a.append(d)
            else:
                a[j + 1] += d
            a[j] = c
            j += 1
    print(ans)