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:
cases = int(input(''))

for i in range(cases):
    actual_sum = 0
    flag = False
    info = input('').split(' ')
    digit_sum = int(info[1])
    corrector_digits = 0

    for j in range(len(info[0])):
        actual_sum = actual_sum + int(info[0][j])
        if (actual_sum >= digit_sum) and (flag == False):
            if (j > 0):
                corrector_digits = int(info[0][0:j]) + 1
            flag = True    

    if (actual_sum <= digit_sum):
        print("0")
        continue

    if (corrector_digits == 0):
        print(10**int(len(info[0])) - int(info[0]))
        continue

    if (corrector_digits != 0):
        while corrector_digits < int(info[0]):
            corrector_digits = corrector_digits * 10;
        print(corrector_digits - int(info[0]))