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())

def digits(n):
    l = []
    while n > 0:
        l.append(n % 10)
        n //= 10
    l.reverse()
    return l

def form(l):
    n = 0
    for i in l:
        n *= 10
        n += i
    return n

for case in range(cases):
    n, s = map(int, input().split())
    d = digits(n)
    if sum(d) <= s:
        print(0)
        continue

    num_acceptable = 0
    this_sum = 0
    for i in d:
        if this_sum + i < s:
            num_acceptable += 1
            this_sum += i
        else:
            break

    if num_acceptable == 0:
        d = [1] + [0] * len(d)
        print(form(d) - n)
    else:
        d = d[:num_acceptable] + [0] * (len(d) - num_acceptable)
        d[num_acceptable - 1] += 1
        print(form(d) - n)