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 getno(l):
    return int("".join(list(map(str, l))))

for _ in range(int(input())):
    n, s = [int(x) for x in input().split()]
    cs = 0
    for i in str(n):
        cs += int(i)
    if cs<=s:
        print(0)
        continue
    cs -= s
    no = list(map(int, str(n)))
    for j in range(len(no)-1, -1, -1):
        if no[j]==0:
            continue
        if cs+1<=no[j]:
            no[j] = 0
            if j:
                ind = j-1
                while ind>=0 and no[ind]==9:
                    no[ind] = 0
                    ind-= 1
                if ind>=0:
                    no[ind] += 1
                else:
                    no.insert(0, 1)
            else:
                no.insert(0, 1)
            break
        else:
            cs -= no[j]
            no[j] = 0
    print(getno(no)-n)