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.*;
public class Solution
{
    public static void main(String[] args)
    {
        Scanner sc =new Scanner(System.in);
        int t =sc.nextInt();
        for(int j=0;j<t;j++)
        {
            long n =sc.nextLong();
            int val=sc.nextInt();
            String s=""+n;
            //System.out.println(s);
            int sum=0;
            for(int i=0;i<s.length();i++)
               sum+=s.charAt(i)-'0';
            if(sum<=val)
            {
                   System.out.println(0);
                   continue;
            }
            sum=0;
            int ind=-1;
            for(int i=0;i<s.length();i++)
            {
                sum+=s.charAt(i)-'0';
                if(sum>=val)
                    break;
                ind=i;
            }
            if(ind==-1)
            {
                long num=(long)Math.pow(10,s.length())-n;
                System.out.println(num);
            }
            else
            {
                long num=0,start=s.length()-1;
                for(int i=0;i<ind;i++,start--)
                   num+= (long)Math.pow(10,start)*(long)(s.charAt(i)-'0');
               num+=(long)Math.pow(10,start)*(long)((s.charAt(ind)-'0')+1);
               System.out.println(num-n);
            }
        }
    }
}