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:
def answer(n,s):
    count=0
    l=[int(i) for i in str(n)]
    l=l[::-1]
    for i in l:
        count+=i
    
    move=0
    i=0
    while count>s:
        if l[i]!=0:
            move+=(10-l[i])*10**i
            l[i]=0
            carry=1
            index=i+1
            while index<len(l) and carry:
                x=(l[index]+carry)
                l[index]=x%10
                carry=x//10
                index+=1

            if carry>0:
                l.append(carry)
                
            count=sum(l)
        i+=1
            

            
    return move
        

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