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:
#Codeforces.com round #667
#Problem D
import sys

#
#BEGIN TEMPLATE
#
def input():
    return sys.stdin.readline()[:-1]

def getInt():
    #Assumes next line consists of only one integer and returns an integer
    return int(input())

def getIntIter():
    return map(int, input().split())

def getIntList():
    return list(getIntIter())

#
#END TEMPLATE
#    

for _ in range(int(input())):
    n,s = getIntIter()

    digits = []
    while n > 0:
        digits.insert(0,n % 10)
        n = n//10

    if sum(digits) <= s:
        print(0)

    else:
        currSum = 0
        i = -1
        while currSum < s and i+1 < len(digits):
            i += 1
            currSum += digits[i]
        digits = digits[i:]
        num = sum((10**(len(digits)-1-i))*digits[i] for i in range(len(digits)))
        print(10**len(digits)-num)