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 sys import stdin

def digsum(n):
    ret = 0
    while n > 0:
        ret += n % 10
        n //= 10
    return ret

def solve(n,s):

    #print (n)
    oldn = n
    if digsum(n) <= s:
        return 0
    else:
        NS = []
        while n > 0:
            NS.append(n % 10)
            n //= 10
        NS.append(0)
        NS.reverse()
        #print (NS)
        tmpsum = 0
        flag = False
        for i in range(len(NS)):
            
            tmpsum += NS[i]
            if tmpsum >= s and flag == False:
                flag = True
                NS[i-1] += 1
            if flag:
                NS[i] = 0
                
        #print (NS)
        nex = 0
        for i in NS:
            nex *= 10
            nex += i
        return solve(nex,s) + (nex - oldn)

tt = int(stdin.readline())

for loop in range(tt):

    n,s = map(int,stdin.readline().split())
    print (solve(n,s))