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 digit_sum_count(n):
    sum_of_digits = 0
    for symbol in n:
        sum_of_digits += int(symbol)
    return sum_of_digits


t = int(input())
for _ in range(t):
    n, s = map(int, input().split())
    n = str(n)
    n = '0' + n
    digit_sum = 0
    next_num = ''
    ds = digit_sum_count(n)
    if ds > s:
        for symbol in n:
            if digit_sum + int(symbol) > s - 1:
                digit_sum_bad = True
                break
            else:
                digit_sum += int(symbol)
                next_num += symbol
        next_num_len = len(next_num)
        next_num = str(int(next_num) + 1)
        next_num += '0' * (len(n) - next_num_len)
        print(int(next_num) - int(n))
    else:
        print(0)