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:
// Working program with FastReader 
import java.io.BufferedReader; 
import java.io.IOException; 
import java.io.InputStreamReader; 
import java.util.Scanner; 
import java.util.StringTokenizer; 
import java.util.*;
import java.io.*;
public class D_Decrease_the_Sum_of_Digits{
    public static void main(String[] args) {
       FastReader sc=new FastReader();
        PrintWriter out = new PrintWriter(System.out);
        int test = sc.nextInt();
        for(int t=0;t<test;t++){
            String input = sc.next();
            int n = input.length();
            int s = sc.nextInt();
            int sum =0;
            for(int i =0;i<n;i++){
                sum += input.charAt(i)-'0';
            }
            if(sum<=s){
                out.println(0);
            }
            else{
                long ans = 0;
                int power = 0;
                int i = n-1;
                boolean addone = false;
                while(sum>s){
                    if(i>=0){
                        int temp = input.charAt(i)-'0';
                        if(addone)temp++;
                        if(temp!=0){
                            sum -= temp;
                            sum++;
                            ans += (long)(10-temp)*((long)Math.pow(10,power));
                            addone = true;
                        }
                        power++;
                        i--;
                    }
                    
                }
                out.println(ans);
            }
            
        }
        out.close();
    }

    
    public static class FastReader 
    { 
        BufferedReader br; 
        StringTokenizer st; 

        public FastReader() 
        { 
            br = new BufferedReader(new
                    InputStreamReader(System.in)); 
        } 

        String next() 
        { 
            while (st == null || !st.hasMoreElements()) 
            { 
                try
                { 
                    st = new StringTokenizer(br.readLine()); 
                } 
                catch (IOException e) 
                { 
                    e.printStackTrace(); 
                } 
            } 
            return st.nextToken(); 
        } 

        int nextInt() 
        { 
            return Integer.parseInt(next()); 
        } 

        long nextLong() 
        { 
            return Long.parseLong(next()); 
        } 

        double nextDouble() 
        { 
            return Double.parseDouble(next()); 
        } 

        String nextLine() 
        { 
            String str = ""; 
            try
            { 
                str = br.readLine(); 
            } 
            catch (IOException e) 
            { 
                e.printStackTrace(); 
            } 
            return str; 
        } 
}
}