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 to_int(digits):
    return int(''.join(map(str, digits)))


def solve(cur, target_sum):
    cur = [ord(ch) - ord('0') for ch in str(cur)]
    cur = [0] + cur
    copied = cur.copy()
    if sum(cur) <= target_sum:
        return 0
    for i in range(len(cur) - 1, -1, -1):
        copied[i] = 0
        if copied[i - 1] == 9:
            continue
        copied[i - 1] = cur[i - 1] + 1
        if sum(copied) <= target_sum:
            return to_int(copied) - to_int(cur)


for _ in range(int(input())):
    cur, target_sum = map(int, input().split())
    print(solve(cur, target_sum))