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:
#!/usr/bin/env python3

from collections import deque


def get_digits(n):
    digits = deque()
    while n > 0:
        digits.append(n % 10)
        n //= 10
    return digits


for _ in range(int(input())):
    n, s = map(int, input().split())
    digits = get_digits(n)
    s1 = sum(digits)
    if s1 <= s:
        print(0)
        continue

    count = 0
    c = 0
    mult = 1
    while len(digits) > 0 and s1 > s:
        digit = digits[0] + c
        digits.popleft()
        c = 0

        if digit == 10:
            s1 -= 9
            c = 1
        elif digit != 0:
            count += mult * (10 - digit)
            s1 -= digit
            s1 += 1
            c = 1

        mult *= 10

    print(count)