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 Counter,defaultdict as dft,deque
def mp():return map(int,input().split())
def ml():return list(map(int,input().split()))

def solve():
    n,s=input().split()
    s=int(s)
    ls=list(n)
    ln=len(ls)
    ls=deque([int(num) for num in ls])
    sm=sum(ls)

    step=0
    while(sm>s):
        i=ln-1
        temp=0
        while(ls[i]==0):
            i-=1
            temp+=1
        
        step+=(10-ls[i])*int(math.pow(10,temp))
        ls[i]=0
        i-=1
        while(i>=0 and ls[i]==9):
            ls[i]=0
            i-=1
        if i==-1:
            ls.appendleft(1)
            ln+=1
        else:
            ls[i]+=1
        sm=sum(ls)
    print(step)
            
#t=1
t=int(input())
for _ in range(t):
    solve()