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:
def solver(n,s):
    if n <= s : return 0
    if sum(map(int,list(str(n)))) <= s : return 0
    memo = []
    X = list(str(n))
    for _ in range(1,len(X)) :
        memo.append( int ( str(n)[:_] ) + 1  )
    memo.append(n)
    memo = memo[::-1]    
    for i in range(1,len(X) + 1)  :
        memo[i - 1] = str(memo[i - 1]) + '0' * (i - 1)
    memo.append('1' + '0'*(len(X)))
    for i in memo :
        reached = sum(map(int,list(i)))
        if reached <= s :
            return int(i) - n 
if __name__ == "__main__":
    t = int(input())
    Testcase = [ list(map(int,input().split())) for i in range(t)]
    for n,s in Testcase :
        opt = solver(n,s)
        print(opt)