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 i in range(t):
    n, s = map(int, input().split())
    pn = n
    tn = []
    while n:
        n, a = divmod(n, 10)
        tn.append(a)
    tn.append(0)

    def cal(p):
        tn[p] = 0
        tn[p+1] += 1
        for d in range(p+1, 100000000):
            if tn[d] == 10:
                tn[d] = 0
                tn[d+1] += 1
            else:
                break
        return sum(tn) <= s

    if sum(tn) <= s:
        print(0)
        continue
    for j in range(0, 100000):
        if cal(j):
            print(int(''.join(map(str, tn[::-1])))-pn)
            break