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
import collections
import functools
import sys
import os

input = sys.stdin.read
readInts = lambda: list(map(int, input().split()))
 
def readChar():
    c = input(1)
    while c == '\n' or c == '\r' or c == ' ':
        c = input(1)
 
    return c
 
def readStr():
    c = input(1)
    while c == '\n' or c == '\r' or c == ' ':
        c = input(1)
    
    s = str()
    while c != '\n' and c != '\r' and c != ' ':
        s += c
        c = input(1)
 
    return s
 
def readInt():
    c = input(1)
    while c != '-' and not c.isdigit():
        c = input(1)
 
    d: int = -1
    x: int = 0
    if c.isdigit():
        d = 1
    else:
        c = input(1)
    
    while c.isdigit():
        x = x * 10 + ord(c) - ord('0')
        c = input(1)
    
    return d * x
 
 
def gcd(a, b):
    while b > 0:
        a, b = b, a % b
    return a
 
def lcm(a, b):
    return a * b // gcd(a, b)
 
eps = 10 ** -9
inf = 10 ** 18
mod = 10 ** 9 + 7 # 998244353 
 
def solution():
    a = readInt()
    b = readInt()
    if a % b == 0:
        os.write(1, str.encode('0\n'))
    else:
        os.write(1, str.encode(str((a // b + 1) * b - a) + '\n'))
 
tests = 1
tests = readInt()
while tests > 0:
    solution()
    tests -= 1