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:
for _ in range(int(input())):
    n, s = map(int, input().split())
    a = list(map(int, list(str(n))))
    temp = 0
    ans = 0
    x = len(a)
    for i in range(x):
        if a[i] + temp > s:
            for j in range(i, x):
                a[j] = 0
            c = i - 1
            while c >= 0 and temp + 1 > s:
                temp -= a[c]
                a[c] = 0
                c -= 1
            if c < 0:
                a.insert(0, 1)
            else:
                a[c] += 1
            break
        else:
            temp += a[i]
    new = 0
    p = 0
    for i in range(len(a) - 1, -1, -1):
        new += (a[i] * pow(10, p))
        p += 1
    print(new - n)