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 Counter
import string
import math
import sys
def array_int():
    return [int(i) for i in sys.stdin.readline().split()]
def vary(arrber_of_variables):
    if arrber_of_variables==1:
        return int(sys.stdin.readline())
    if arrber_of_variables>=2:
        return map(int,sys.stdin.readline().split()) 
def makedict(var):
    return dict(Counter(var))
# i am noob wanted to be better and trying hard for that
def printDivisors(n) : 
    divisors=[]  
    # Note that this loop runs till square root 
    i = 1
    while i <= math.sqrt(n): 
          
        if (n % i == 0) : 
              
            # If divisors are equal, print only one 
            if (n//i == i) : 
                divisors.append(i) 
            else : 
                # Otherwise print both 
                divisors.extend((i,n//i)) 
        i = i + 1
    return divisors
def sumt(n):
    return sum([int(i) for i in str(n)])
# print(217871987498122+2128012501878)
for _ in range(vary(1)):
    n,s=vary(2)
    if sumt(n)<=s:
        print(0)
        continue
    num=[int(i) for i in str(n)]
    sumt2=0
    ind=0
    for i in range(len(num)):
        if sumt2+num[i]<s:
            sumt2+=num[i]
            continue
        else:
            ind=i
            break
    j=0
    ans=''
    # print(ind)
    for i in range(len(num)-1,ind-1,-1):

        if j==0:
            if num[i]==0:
                ans+=str(0)
                continue
            ans+=str(10-num[i])
            j=1
            continue
        ans+=str(9-num[i])
    print(str(int(ans[::-1])))