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 PYTHON):

Solution:
# inp.readline()
# int(inp.readline())
# out.write()
# raw_input()
# map(int,raw_input().split())
# map(int,inp.readline().split())
# for _ in xrange(input()):
# print "Case #"+str(_+1)+": "+ 
if __name__ == "__main__":
    from sys import stdin as inp, stdout as out,setrecursionlimit as srl
    from collections import Counter,defaultdict,deque
    from heapq import *
    def f(i,s,b):
        if s<0:
            return 0
        if i==len(z):
            if b:
                return int(''.join(map(str,z)))
            return 0
        for j in xrange(0 if b else a[i],10):
            z[i]=j
            x=f(i+1,s-j,b or j>a[i])
            if x:
                return x
            z[i]=9
        return 0
    for _ in xrange(input()):
        a,s=map(int,inp.readline().split())
        a=[0]+map(int,str(a))
        if sum(a)<=s:
            print 0
        else:
            z=[9]*len(a)
            print f(0,s,False)-int()-int(''.join(map(str,a)))