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 to_digits(n):
    return list(map(int, str(n)))


def digits_to_int(digits):
    return int(''.join(map(str,digits)))


if __name__ == '__main__':
    t = int(input())
    for _ in range(t):
        n, s = map(int, input().split())

        digits = [0]+to_digits(n)

        if sum(digits) <= s:
            print(0)
            continue

        # print(digits)
        i = 1
        while sum(digits[:i]) < s:
            i += 1

        # digits[i - 2] += 1
        # print(i)

        new_n = digits_to_int(digits[:i-1] + [0]*(len(digits) - i + 1))
        new_n += 10**(len(digits) - i + 1)

        # print(n)
        print(new_n - n)
        # print(new_n)
        # print('--')