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())

def sum_d(string):
    return sum(int(x) for x in string)

for _ in range(t):
    n, s = list(map(int, input().split()))
    start = str(n)
    if sum_d(start) <= s:
        print(0)
        continue
    for digits in range(1, len(start) + 1):
        # Try setting the first `digits` digits to 0.
        if sum_d(start[-digits:]) == 0:
            # Already the case
            continue
        # Increment the next digit.
        new_str = [x for x in start]
        for x in range(digits):
            new_str[(-1-x)] = '0'
        if digits == len(start):
            new_str.insert(0, '1')
        else:
            for x in range(len(start) - digits):
                if new_str[len(start) - digits - 1 - x] == '9':
                    new_str[len(start) - digits - 1 - x] = 0
                    if x == len(start) - digits - 1:
                        new_str.insert(0, '1')
                else:
                    new_str[len(start) - digits - 1 - x] = int(new_str[len(start) - digits - 1 - x]) + 1
                    break
        if sum_d(new_str) <= s:
            new_val = 0
            for val in new_str:
                new_val *= 10
                new_val += int(val)
            print(new_val - n)
            break