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:
import math

def solve(n, s):
    digits = []
    nn = n
    sums = []
    sm, c = 0, 0
    while nn>0:
        x = nn % 10
        digits.append(x)
        sums.append(sm)
        sm -= x
        c += x
        nn = nn // 10

    more = 0
    m = 1
    for i, x in enumerate(sums):
        if x + c + more <= s:
            break
        more = 1 if more or digits[i]>0 else 0
        m *= 10
    if m == 1:
        return 0
    return m - n % m

if __name__ == '__main__':
    t = int(input())
    for _ in range(t):
        n, s = (int(x) for x in input().split())
        print(solve(n, s))