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())
for ex in range(t):
    n, s = [int(i) for i in input().split()]
    di = list()
    n1 = n
    while n1 > 0:
        di.append(n1 % 10)
        n1 //= 10
    di_s = sum(di)
    ans = -1
    if di_s <= s:
        print(0)
    else:
        for i in range(len(di)):
            if di_s + 1 <= s:
                ans = (n // (10 ** i) + 1) * (10 ** i) - n
                break
            else:
                di_s -= di[i]
        if ans == -1:
            print(10 ** len(di) - n)
        else:
            print(ans)
    # for i in range(len(d