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 PYTHON):

Solution:
from __future__ import print_function, division
from sys import stdin, stdout

rints = lambda: [int(x) for x in stdin.readline().split()]
str_sum = lambda s: sum([int(x) for x in s])
out = []

for _ in range(int(input())):
    n, s = rints()
    n1 = str(n)
    su = str_sum(n1)

    if su <= s:
        out.append(0)
    else:
        plus, ans = 10, float('inf')
        for i in range(len(n1) - 1, -1, -1):
            cur = n - (n % plus) + plus
            su = str_sum(str(cur))
            plus *= 10

            if su <= s:
                ans = min(ans, cur)

        out.append(ans - n)

print('\n'.join(map(str, out)))