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(n, s):
    sn = str(n)
    ans = ''
    len_sn = len(sn)
    for i in range(len_sn - 1, -1, -1):
        ans = str(int(sn[0:(i + 1)]) + 1)
        digit_sum = sum(int(d) for d in ans)
        if digit_sum <= s:
            ret = int(ans.ljust(len_sn, '0'))
            if ret < n:
                ret *= 10
            return ret
    return int('1' + '0' * len_sn)

t = int(input())
for _ in range(t):
    n, s = map(int, input().split())
    digit_sum = sum(int(d) for d in str(n))
    if digit_sum <= s:
        print(0)
    else:
        nf = solve(n, s)
        print(nf - n)