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:
n = int(input())
for k in range(n):
    test = input().split(" ")
    maxi = int(test[1])
    l = len(test[0])
    suma = 0
    test[0] = list(map(int, test[0]))
    
    i = 0
    i2 = -1
    for i in range(l):
        suma += test[0][i]
        if suma > maxi:
            break
        if suma == maxi and i2 == -1:
            i2 = i

    zeros = True
    ret = []
    if suma <= maxi:
        ret = [0]
        i += 1
    else:
        if i2 > -1:
            i = i2
    for j in range(1, l - i + 1):
        c = test[0][l - j]
        if zeros:
            if c == 0:
                ret.append(0)
            else:
                zeros = False
                ret.append(10 - c)
        else:
            ret.append(9 - c)

    x = l - i - 1
    if len(ret) > 1:
        while ret[x] == 0:
            x -= 1
    print(''.join(map(str, ret[x::-1])))