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())
for t in range(T):
    n, s = input().split()
    fixn = n
    n_list = [0] + [int(i) for i in n]
    m = len(n_list)
    s = int(s)
    cur_sum = sum(n_list)
    ans = 0
    right_pointer = m-1
    while cur_sum > s:
        while n_list[right_pointer] == 0:
            right_pointer -= 1
        # now i stop at the first non-zero
        n_list[right_pointer-1] += 1
        n_list[right_pointer] = 0
        new_pointer = right_pointer -1
        while n_list[new_pointer] >= 10:
            n_list[new_pointer] %= 10
            n_list[new_pointer-1] += 1
            new_pointer -= 1
        cur_sum = sum(n_list)
    # now evaluate the difference
    tmp = 0
    for i in range(m):
        tmp *= 10
        tmp += n_list[i]
    print(tmp - int(fixn))