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.* ;

public class Main {


    public  static void main (String args [] ) throws IOException ,InterruptedException {
        Scanner sc = new Scanner(System.in);
        PrintWriter pw = new PrintWriter(System.out);

        int t = Integer.parseInt(sc.nextLine()) ;
        while (t-->0){
            long n = sc.nextLong();
            int s = sc.nextInt() ;
            if (digSum(n)<=s)
                pw.println(0);
            else {

                long y = n ;
                long z = 10L ;

                y += (10-(y%10))%10 ;

                while (digSum(y)>s){
                    y += ((10-((y/z)%10))%10)*z ;
                    z*=10 ;
                }
                pw.println(y-n);
            }
        }

        pw.close();
    }
    static long returnLong (ArrayList<Integer> x){
        String a = "" ;
        for (int i=x.size()-1 ; i>=0 ; i-- ) {
            a = x.get(i) + a ;
        }
        return Long.parseLong(a);
    }

    static int digSum (long a ) {
        int s = 0 ;
        while (a!=0){
            s+= a%10 ;
            a = a/10 ;
        }
        return s ;
    }
    static class Scanner {
        StringTokenizer st;
        BufferedReader br;

        public Scanner(InputStream system) {
            br = new BufferedReader(new InputStreamReader(system));
        }

        public Scanner(String file) throws Exception {
            br = new BufferedReader(new FileReader(file));
        }

        public String next() throws IOException {
            while (st == null || !st.hasMoreTokens())
                st = new StringTokenizer(br.readLine());
            return st.nextToken();
        }

        public String nextLine() throws IOException {
            return br.readLine();
        }

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

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

        public char nextChar() throws IOException {
            return next().charAt(0);
        }

        public Long nextLong() throws IOException {
            return Long.parseLong(next());
        }

        public boolean ready() throws IOException {
            return br.ready();
        }

        public void waitForInput() throws InterruptedException {
            Thread.sleep(3000);
        }
    }
}