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:
if __name__=="__main__":

    t=int(input())
    for i in range(t):
        n,s=map(int,input().split())

        digits=[int(x) for x in str(n)]
        sum=0
        for j in range(len(digits)):
            sum+=digits[j]

        if sum<=s:
            print("0")

            continue
        else:
            if digits[0]>s or digits[0]+1>s:
                ans=[0]*len(digits)
                ans.insert(0,1)
                newans=''.join([str(x) for x in ans])
                newans=int(newans)
                newdigits=''.join([str(x) for x in digits])
                newdigits=int(newdigits)
                newans=newans-newdigits
            else:
                current=digits[0]
                put=0
                for j in range(1,len(digits)):
                    if (digits[j]+1)+current>s:
                        put=j
                        break
                    else:
                        current+=digits[j]
            
                ans=[0]*(len(digits)-put)
                ans.insert(0,1)
            
                newans=''.join([str(x) for x in ans])
                
                newans=int(newans)
                newdigits=''.join([str(digits[x]) for x in range(put,len(digits))])
                newdigits=int(newdigits)
              
                newans=newans-newdigits
        print(newans)