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:
from sys import stdin, stdout


# 217871987498122 10
def decrease_the_sum_of_digits(n, s):
    n_s = str(n)
    v = 0
    ans = 0
    for i in range(len(n_s)):
        v += ord(n_s[i]) - ord('0')
        if v >= s and ans == 0:
            ans = 10**(len(n_s)-i) - int(n_s[i:])

    if v == s:
        return 0
    else:
        return ans


t = int(stdin.readline())
for _ in range(t):
    n, s = map(int, stdin.readline().split())
    ans = decrease_the_sum_of_digits(n, s)
    stdout.write(str(ans) + '\n')