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 solve(n, s):
    # print(f"n = {n}, s = {s}")
    n_str = str(n)
    digits = map(int, n_str)
    curr_sum = 0
    ans = 0
    for (i, d) in enumerate(digits):
        curr_sum += d
        # print(f"curr_sum={curr_sum} s={s} d={d}")
        if curr_sum > s:
            sup_i = i
            tail = int(n_str[i:])
            # print(f"TAIL = {tail}")
            ten_p = 10**(len(n_str)-i)
            # print(f"TEN_P = {ten_p}")
            ans = ten_p - tail
            # print(f"ANS = {ans}")
            return ans + solve(n + ans, s)
    return 0
    

t = int(input())
for _ in range(t):
    n, s = map(int, input().split())
    print(solve(n, s))