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:
from math import *
t=int(input())

while t:
        t=t-1
        #n=int(input())
        #n,x,y=map(int,input().split())
        #a=list(map(int,input().split()))
        a,s=input().split()
        n=len(a)
        s=int(s)
        flag=0
        l=[]
        ss=0
        z=-1
        for i in a:
                ss+=int(i)
                l.append(ss)
        if ss<=s:
                print(0)
                continue
        for i in range(n-1,-1,-1):
                if a[i]!='9':
                        if (l[i]+1)<=s:
                                flag=1
                                z=i
                                break
                else:
                        temp=a[:i+1]
                        temp=int(temp)+1
                        temp=str(temp)
                        sum=0
                        for j in temp:
                                sum+=int(j)
                        if sum<=s:
                                flag=1
                                z=i
                                break
        out1=""
        out2=""
        if flag==0:
                out='1'+'0'*n
                print(int(out)-int(a))
                continue
        for i in range(n):
                if i<=z:
                        out1+=a[i]
                else:
                        out2+='0'
        out1=int(out1)+1
        out1=str(out1)
        out1=out1+out2
        #print(out1)
        print(int(out1)-int(a))