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 digits_sum(n):
    s = 0
    while n > 0:
        s += n % 10
        n //= 10
    return s


def main():
    t = int(input())
    for _ in range(t):
        n, s = map(int, input().split())
        sm = digits_sum(n)
        # print(n, s, sm)
        ops = 0
        mul = 1
        while sm > s:
            last = n % 10

            if last != 0:
                n += (10-last)
                sm = digits_sum(n)
                ops += (10-last) * mul
            n //= 10
            mul *= 10

            # print(last, n, sm, ops, mul)
            # input("enter")
        print(ops)


if __name__ == "__main__":
    main()