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, stdout

class SOLVE:
    def solve(self):
        R = stdin.readline
        W = stdout.write
        
        ans = []
        for i in range(int(input())):
            n, s  = [x for x in R().split()]
            s     = int(s)
            
            if sum([int(x) for x in n]) <= s:
                ans += ['0']
                continue
            
            temps = 0
            for j in range(len(n)):
                temps += int(n[j])
                
                if temps >= s:
                    ans += [str(int( str(int('0'+n[:j])+1) + (len(n) - j)*'0') - int(n))]
                    break
            
        W('\n'.join(ans))
        
def main():
    s = SOLVE()
    s.solve()
main()