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

"""
https://codeforces.com/problemset/problem/1328/A
"""

if __name__ == "__main__":

    n = int(input())
    while (n >= 1):

        x = input().split()
        a = int(x[0])
        b = int(x[1])

        rest = a % b
        if(rest == 0):
            diff = 0
        else:
            diff = b - rest

        print(diff)
        n = n - 1


"""
Liest einen Int n ein
Laufe die Schleife n mal durch:
    Lies eine Zeile ein
    Splitte die Zeile beim Leerzeichen und speichere die Liste als x
    a = x[0]
    b = x[1]
    rest = a % b
    wenn(rest == 0):
        Differenz = 0
    Sonst:
        Differenz = b - rest
    print(Differenz)
    n = n -1

"""