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.util.*;
import java.lang.*;
import java.io.*;

/* Name of the class has to be "Main" only if the class is public. */
public class q1
{
	public static void main (String[] args) throws java.lang.Exception
	{
        // your code goes here
        Scanner sc = new Scanner(System.in);
        int t= Integer.parseInt(sc.next());
        while(t-->0)
        {
            String str= sc.next();
            long n = Long.parseLong(str);
            long s = Long.parseLong(sc.next());
            char[] arr = str.toCharArray();
            long hg=0;
            long[] req= new long[str.length()];
            int len = arr.length;
            for(int i=0;i<arr.length;i++)
            {
                hg+=Character.getNumericValue(arr[i]);
                req[i]=hg;
            }
            if(hg<=s)
            {
                System.out.println(0);
                continue;
            }
            long gf=0;
            for(int i=len-1;i>=0;i--)
            {
                int p=len-i;
                long k = n%(long)Math.pow(10,p);
                long ans= (long)Math.pow(10,p)-k;
                n+=ans;
                gf+=ans;
                if(nsum(n)<=s)
                {
                    break;
                }
            }
            System.out.println(gf);

        }
    }
    public static long nsum(long n )
    {
        long sum=0;
        while(n>0)
        {
            sum+=n%10;
            n=n/10;
        }
        return sum;
    }
}