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:
for _ in range(int(input())):
    number, mx = input().split()
    number = [i for i in number]
    mx = int(mx)
    su = sum(int(i) for i in number)
    if su <= mx:
        print(0)
        continue
    number = ['0'] + number
    inumber = int("".join(number))
    ln = len(number)
    res = int(2e18)
    for i in range(ln):
        # change this digit
        nn = number.copy()
        if int(nn[i]) < 9:
            # we can change this
            nn[i] = str(int(nn[i]) + 1)
        for j in range(i + 1, ln):
            nn[j] = '0'
        su = sum(int(i) for i in nn)
        inn = int("".join(nn))
        if inumber <= inn < res and su <= mx:
            res = inn
    print(res - inumber)