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:
from collections import defaultdict, deque
from itertools import permutations, product, combinations
from functools import lru_cache
from time import time
import sys
from operator import itemgetter

start = time()


def show_time():
    print(time() - start, file=sys.stderr)


try:
    f = open('test.in')


    def ints():
        return map(int, f.readline().strip().split())


    def one_int():
        return int(f.readline())


    def one_string():
        return f.readline().strip()


    def strings():
        return f.readline().strip().split()
except FileNotFoundError:
    def ints():
        return map(int, input().strip().split())


    def one_int():
        return int(input())


    def one_string():
        return input().strip()


    def strings():
        return input().strip().split()


def debug(s):
    print(s, file=sys.stderr)


sys.stderr.write('\n')
"""
    problem specific code starts here
"""

t = one_int()
for _ in range(t):
    a, b = ints()
    if a % b == 0:
        print(0)
    else:
        print(b - (a % b))