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 solver(n, x ):
    # if sum(m)>x:
    #     dig = m[-1]
    #     return
    # return 0
    m = list(map(lambda x: int(x), str(n)))
    res = 0
    pw = 1
    if sum(m) <= x:
        return res
    for i in range(18):
        dig = (n//(pw))%10
        add = ((10 - dig)%10)*pw
        n += add
        res += add
        m = list(map(lambda x: int(x), str(n)))
        if sum(m) <= x:
            break
        pw *= 10
    return res


if __name__=='__main__':
    for i in range(int(input())):
        #N = int(input())
        n, x = map(int, input().split())
        #arr = list(map(int,input().split()))
        print(solver(n, x))