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 sd(n):
    sm=0
    while n>0:
        sm+=(n%10) 
        n=n//10 
    return sm 
def lis(n):
    l=[]
    while n>0:
        l.append(n%10) 
        n=n//10 
    l.reverse() 
    return l  
T=int(input()) 
for t in range(T):
    n,s=map(int,input().split()) 
    sm=sd(n)
    n_s=lis(n) 
    ind=len(n_s)-1 
    exp=1
    cnt=0
    while ind>=0 and sm>s: 
        sm=sm+1 
        sm=sm-(n_s[ind]) 
        cnt=cnt+(10-(n_s[ind]))*exp  
        exp*=10  
        ind-=1 
        while ind>=0 and n_s[ind]==9:
            ind=ind-1
            sm=sm-9 
            exp=exp*10
        if ind>=0:
            n_s[ind]=(n_s[ind])+1 
    print(cnt)