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 main():
    t = int(input())
    for i in range(t):
        n, s = map(int, input().split())
        result = find_min_fix_cost(n, necessary_digits_sum=s)
        print(result)


def find_min_fix_cost(n, necessary_digits_sum):
    result_cost = 0
    curr_digit_index = 0
    while sum(map(int, str(n))) > necessary_digits_sum:
        curr_end_value = n % 10 ** (curr_digit_index + 1)
        new_end_value = 10 ** (curr_digit_index + 1)
        increment = new_end_value - curr_end_value
        n += increment
        result_cost += increment
        curr_digit_index += 1
    return result_cost


if __name__ == '__main__':
    main()