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 PYTHON):

Solution:
def sod(n):
    c = 0
    for i in range(len(n)):
        c += int(n[i])
    return c
for test in range(input()):
    n,s  = map(int,raw_input().split())
    nn = n
    n = str(n)
    if sod(n)<=s:
        print 0
        continue
    for i in range(len(n)):
        if i==0:
            fin = '1' + len(n)*'0'
            ans = int(fin)-nn
            continue
        p = n[:i]
        p = str(int(p) + 1)
        p += '0'*(len(n)-len(p))
        if sod(p)<=s:
            if int(p)-nn < 0:
                continue
            ans = min(ans,int(p)-nn)
        else:
            break
    print ans