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:
import math
from collections import defaultdict


for _ in range(int(input())):
    def ans(n):
        co=0
        while True:
            if n==0:
                break
            co+=n%10
            n=n//10
        return co
    
    n,s=list(map(int,input().split())) 
    temp=n
    ln=list(str(n))
    an=0
    for i in range(len(ln)):
        if ans(temp+an)<=s:
            
       
            break
        ln.reverse()
        if ln[i]!="0":
            k=10-int(ln[i])
            k=k*(10**i)
            an+=k
            if i!=len(ln)-1:
                
                ln[i+1]=str(int(ln[i+1])+1)
        ln.reverse()
       
    print(an)