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:
from sys import stdin

class Problem:
    def __init__(self, n, s):
        self.n = n
        self.s = s
        self.stack = []
    
    def solve(self):
        number = '0' + str(self.n)

        current_sum = 0
        for digit in number:
            d = int(digit)
            self.stack.append(d)
            current_sum += d

        adds = 0
        ten = 1
        while current_sum > self.s:
            d = self.stack.pop()
            if d == 0:
                ten = ten * 10
                continue
            if d == 10:
                current_sum = current_sum - 9
                self.stack[-1] += 1
            else:
                current_sum = current_sum - d
                adds = adds + ten * (10 - d)
                current_sum = current_sum + 1
                self.stack[-1] += 1

            ten = ten * 10

        return adds

cases = int(stdin.readline())
for test in range(cases):
    n, s = map(int, stdin.readline().split())
    ans = Problem(n, s).solve()
    print(ans)