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

input = sys.stdin.readline


############ ---- Input Functions ---- ############
def inp():
    return (int(input()))


def inlt():
    return (list(map(int, input().split())))


def insr():
    s = input()
    return (list(s[:len(s) - 1]))


def invr():
    return (map(int, input().split()))

def digitSum(x):
    c = 0
    while x:
        c += x%10
        x //= 10
    return c

def solve(x,y):
    if digitSum(x) <= y:
        return 0
    # Try next power of 10
    xStr = str(x)
    attempt = 10 ** len(xStr) - x

    for i in range(len(xStr)):
        newNumber = int(xStr[:i+1]) + 1
        newNumber *= 10 ** (len(xStr) - i-1)
        if digitSum(newNumber) <= y:
            attempt = newNumber - x
    return attempt

lines = inp()
for i in range(lines):
    v = inlt()
    print(solve(*v))