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:
import sys
ii = lambda: sys.stdin.readline().strip()
idata = lambda: [int(x) for x in ii().split()]

def solve():
    n, s = idata()
    n = list(str(n))
    summ = 0
    ans = 0
    for i in range(len(n)):
        n[i] = int(n[i])
    summ = sum(n)
    if summ <= s:
        print(0)
    else:
        n = n[::-1]
        n += [0]
        i = 0
        c = 1
        while summ > s:
            if n[i] != 0:
                summ -= n[i] - 1
                ans += (10 - n[i]) * c
                n[i] = 10
                j = 0
                while n[i + j] == 10:
                    if j:
                        summ -= 9
                    j += 1
                    n[i + j] += 1
                i += j - 1
                c *= 10 ** (j - 1)
            i += 1
            c *= 10
        print(ans)
    return

for t in range(int(ii())):
    solve()