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())):
    n, s = map(int, input().split())
    nstr = str(n)
    sum = []
    sum.append(int(nstr[0]))
    for i in range(1, len(nstr)):
        lval = sum[-1]
        sum.append(lval+(int(nstr[i])))
    # sum = sum[::-1]
    # print(sum)
    ind = 0
    while(ind < len(nstr)):
        if(sum[ind] >= s):
            break
        ind += 1

    res = nstr[:ind]+'0'*(len(nstr)-ind)
    # print(sum[-1], ind, res)
    if(sum[-1] <= s):
        # print(res)
        print(int(nstr)-n)
    else:
        # if(res[0]=='0'):
        #     res = '1'+res
        # else:
        res = res[:ind-1] + chr(int(res[ind-1])+ord('0')) + res[ind:]
        # print(int(res)+10**(len(nstr)))
        print(int(res)+10**(len(nstr)-ind)-n)