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:
"""
a9qnrp
problem 1409D
09/09/2020
"""

import sys
input = sys.stdin.readline

def inp():
    return(int(input()))

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

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

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


def solve(n, s):
    
    # Get digits of n
    d = list(map(int, str(n)))
    d.insert(0, 0)

    if sum(d) <= s:
        return 0

    for i in range(len(d)-1, 0, -1):
        if sum(d[:i]) + 1 <= s:
            target = d[:]
            for j in range(i, len(d)-1):
                target[j] = 0

            target[i-1] = (target[i-1]+1)%10
            if target[i-1] == 0:
                target[i-2] += 1

            break

    t = 0
    for i in range(0, len(d)-1):
        t += target[i] * pow(10, len(d)-1 - i)

    return t-n
         



if __name__ == "__main__":
    n = inp()
    for _ in range(n):
        n, s = invr()
        print(solve(n, s))