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 JAVA):

Solution:
import java.io.*;
import java.util.*;
import java.util.Arrays.*;
public class digits
{
    public static void main(String[] args) throws IOException
    {
        Scanner in=new Scanner(System.in);
        PrintWriter out=new PrintWriter(System.out);
        int t=in.nextInt();
        while(t-->0)
        {
            int f1=0,su=0,sum1=0,sum=0,c=0,c1=0;
            long nt=0,ct=0,z2=0;
            long r=0,copy=0;
            long n=in.nextLong();
            int s=in.nextInt();
            String v=String.valueOf(n),v2="";
            int length=v.length();
            nt=n;
            while(nt!=0)
            {
                r=nt%10;
                c++;sum+=r;
                nt=nt/10;
            }
            while(length-->0)
            {
                int g=Character.getNumericValue(v.charAt(c1));
                if(sum1+g<s)
                {
                sum1+=g;
                c1++;
                }
                else 
                break;
            }
            if(sum>s)
            {
                if(r<s)
                {
                    //if(c1>1)
                     v2=v.substring(0,c1-1);
                    if(v2.length()>0)
                     z2=Long.valueOf(v2);
                    String v1=v.substring(c1-1);
                    int len=v1.length();
                    int x1=Character.getNumericValue(v.charAt(c1-1));
                    ct=(x1+1)*(long)Math.pow(10,len-1);
                    z2=(z2*(long)Math.pow(10,len))+ct;
                    out.println(z2-n);
                }
                    else
                    {
                        ct=(long)Math.pow(10,c);
                        out.println(ct-n);
                    }
            }
            else
            out.println("0");
    }
    out.close();
}
}