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:
t = int(input())
l = 0

for i in range(t):
    k = input().split(' ')
    a = int(k[0])
    b = int(k[1])

    if b > a:
        print(b-a)
    elif a % b == 0:
        print(0)
    else:
        lol = a//b
        lul = b* (lol+1)  
        print(lul-a)



    # if a / b < 2 and b / a > 2:
        # if a > b:
            # print(a%b)
        # elif a == b:
            # print(0)
        # else:
            # print(b-a)

    # else:
        # if b>a and b / a < 2:
            # print(b-a)

        # elif a==b:
            # print(0)
        # else:
            # kek = b 
            # while b<a:
                # b += kek
            # print(b-a)