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 main():
    t = int(input())
    for tt in range(t):
        n, s = input().split()
        s = int(s)
        k = len(n) + 1
        stt = int(n)
        n = [0] + [int(i) for i in n]
        if(sum(n) <= s):
            print(0)
            continue
        bst = 10**(k - 1)
        for i in range(1, k):
            if(n[i] == 0):
                continue
            new = n.copy()
            new[i - 1] += 1
            new[i :] = [0] * (k - i)
            if(sum(new) > s):
                continue
            nm = 0
            for j in range(k):
                nm = nm*10 + new[j]
            if(bst - stt >= nm - stt):
                bst = nm
        print(bst - stt)
main()