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:
"""
Created on Sun Aug 16 00:38:26 2020

@author: roastedcoder

This is for HackerEarth
"""

#mod = 1000000007
ssi = lambda : map(int,input().split())

# RoastedCoder

def sm(n):
    n = str(n)
    res = 0
    for i in range(len(n)):
        res += int(n[i])
    return res

for _ in range(int(input())):
     n, s = ssi()
     
     if sm(n)<=s:
         print(0)
     else:
         res = 0
         i = len(str(n))-1
         pw = 1
         while(sm(n)>s and i>=0):
             d = (n//pw)%10
             tmp = pw*((10-d)%10)
             n += tmp
             res += tmp
             pw *= 10
             i -= 1
         print(res)




'''
I/P:
5
2 1
1 1
500 4
217871987498122 10
100000000000000001 1

O/P:
8
0
500
2128012501878
899999999999999999
'''