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:
t=int(input())
for i in range(t):
    n,s=input().split()
    c=[]
    n=[int(u) for u in n]
    s=int(s)
    j=len(n)-1
    
    sm=0
    for x in n:
        sm+=x 
    #if (sm>s):
        #print("greater")
    if sm<=s:
        print(0)
    else:    
        
        while sm>s and j>=0:
           
            if n[j]!=0 and j!=0:
                sm-=n[j]-1 
                c.append(10-n[j])
                n[j]=0 
                n[j-1]+=1
                
                    
            elif n[j]==0 and j!=0:
                c.append(0)
            
            elif n[j]!=0 and j==0:
                 
                sm-=(n[j]-1)
                c.append(10-n[j])
                n[j]=0
            j-=1 
            #print(sm,c)
        d=c[-1::-1]
        
        k=""
        for x in d:
            k+=str(x)
        print(int(k))