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:

#------------------------------warmup----------------------------
# *******************************
# * AUTHOR:  RAJDEEP GHOSH      *   
# * NICK  :  Rajdeep2k          *  
# * INSTITUTION: IIEST, SHIBPUR *
# *******************************
import os
import sys
from io import BytesIO, IOBase
import math 
BUFSIZE = 8192
 
 
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)
input = lambda: sys.stdin.readline().rstrip("\r\n")
 
#-------------------game starts now---------------------------------------------------
t=(int)(input())
for _ in range(t):
    # n=(int)(input())
    # l=list(map(int,input().split()))
    inp,b=map(int,input().split())
    actual=inp
    a=[]
    # a=list()
    # n=len((str(inp)))
    
    # for i in range(n):
    #     a[i]=(str(inp))[i]
    res=0
    while(inp>0):
        a.append(inp%10)
        res+=(inp%10)
        inp=inp//10
        
    a=a[::-1]
    n=len(a)
    # print(*a)
    a=[0]+a
    yyy=0
    t=0
    ll=list()
    for i in range(n):
        ll.append(inp%10)
    bbb=b
    if res<=b:
        print(0)
    else:
        while yyy<bbb:
            yyy+=a[t]
            t+=1
        t-=2
        a[t]+=1
        newno=0
        for i in range(t-1,-1,-1):
            a[i]+=a[i+1]//10
        i=0
        n+=1
        while(i<n):
            a[i]%=10
            i+=1
        j=t+1    
        while j<n:
        # for j in range(t+1,n):
            a[j]=0
            j+=1
        # no=0    
        for _ in a:
            newno=newno*10+_
        kiu=90
        print(newno-actual+98-8-kiu)