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 math
# from collections import Counter
#from collections import defaultdict
#from collections import deque
# from bisect import bisect_left as bl, bisect_right as br
# from itertools import accumulate,permutations as perm,combinations as comb
# import heapq
# from functools import reduce
# from fractions import Fraction


import sys


def main():
    t = Iint()
    for _ in range(t):
        actual_value, max_sum = Imap()  # m being max sum
        s = str(actual_value)
        s = ([0]+[int(si) for si in s])
        n = len(s)
        if sum(s) <= max_sum:
            print(0)
            continue
        digit_sum = 0
        actual_sum = 0
        t = 10**(n-1)
        debug(s, c=5)
        for i in range(n):
            digit_sum += s[i]
            if digit_sum >= max_sum:
                actual_sum += t*10
                break
            actual_sum += s[i]*t
            t //= 10
        debug(actual_sum, actual_value)
        print(actual_sum-actual_value)


en = enumerate
# IO region1
FIO = 10
BUFSIZE = 8*1024


def Istr(): return input()


def Iint(): return int(input())


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


def Imap(): return map(int, input().split())   # int map


def Plist(li, s=' '): print(s.join(map(str, li)))   # non string iterable


def debug(*args, c=6): pass  # ; print('\033[3{}m'.format(c), *args, '\033[0m', file=sys.stderr)


if not FIO:
    if __name__ == '__main__':
        main()
        exit()
else:
    from io import BytesIO, IOBase
    import os
# FastIO


class FastIO(IOBase):
    newlines = 0

    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None

    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()

    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()

    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)


class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")


sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)


def input(): return sys.stdin.readline().rstrip("\r\n")

# /IO region


if __name__ == '__main__':
    main()