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

public class Codeforce2 {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        OutputWriter out = new OutputWriter(outputStream);
        Solver solver = new Solver();
        solver.solve(in,out);
        out.close();

    }

    static class Solver{
        boolean[] visited;
        ArrayList<Integer>[] adjList;
        final long MOD = 1000000007;
        int[] order;
        int[] orderFreq;

        public void solve(InputReader in, OutputWriter out){

            int t = in.nextInt();
            for(int i=0;i<t;i++){
                String n = in.next();
                long num = Long.parseLong(n);
                int s = in.nextInt();
                int sum = 0;
                long ans = 0;
                for(int j=0; j<n.length();j++){
                    sum+=n.charAt(j)-'0';
                }
                if(sum<=s){
                    out.printf("0\n");
                    continue;
                }
                long sig = 1;
                for(int j=n.length()-1;j>=0;j--){
                    if(sum<=s) break;
                    long digit = num%10;
                    if(digit!=0){
                        ans+= (10-digit)*sig;
                        num+=10;
                    }
                    sum = 0;
                    num/=10;
                    for(char c : Long.toString(num).toCharArray()) sum+=c-'0';
                    //System.out.print(ans+ " ");
                    sig*=10;
                }
                out.printf("%d\n", ans);
            }
        }

        public int gcd(int a, int b) {
            if (b==0) return a;
            return gcd(b,a%b);
        }
        public long gcd(long a, long b) {
            if (b==0) return a;
            return gcd(b,a%b);
        }


        private void initAdjList(int n){
            adjList = new ArrayList[n];
            visited = new boolean[n];
            for(int i=0;i<n;i++){
                adjList[i] = new ArrayList<>();
            }
        }

        class Edge{
            int weight;
            int node;
            public  Edge(int node, int weight){
                this.node = node;
                this.weight = weight;
            }
        }

        class Pair{
            String name;
            int score;
            public Pair(String name, int score){
                this.name = name;
                this.score = score;
            }
        }

        private int dfs(int u){
            visited[u] = true;
            if(adjList[u].size()<=1){
                return 0;
            }
            int order = Integer.MAX_VALUE;
            for(int v: adjList[u]){
                if(!visited[v]){
                    order = Math.min(dfs(v)+1,order);
                }
            }
            return order;
        }

//        private void bfs(int s) {
//            Queue<Integer> q = new LinkedList<Integer>();
//            q.add(s);
//            visited[s] = true;
//            while(!q.isEmpty()) {
//                int u = q.remove();
//                for(int v: adjList[u]){
//                    if(!visited[v]) {
//                        visited[v] = true;
//                        q.add(v);
//                    }
//                }
//
//            }
//        }

        private  int[] nextAInt(int n, InputReader in){
            int arr[] = new int[n];
            for(int i=0;i<n;i++){
                arr[i]= in.nextInt();
            }
            return arr;
        }

        private  long[] nextALong(int n, InputReader in){
            long arr[] = new long[n];
            for(int i=0;i<n;i++){
                arr[i]= in.nextInt();
            }
            return arr;
        }

    }


    static class InputReader {
        private InputStream stream;
        private byte[] buf = new byte[1 << 16];
        private int curChar;
        private int numChars;

        public InputReader(InputStream stream) {
            this.stream = stream;
        }

        public int read() {
            if (this.numChars == -1) {
                throw new InputMismatchException();
            } else {
                if (this.curChar >= this.numChars) {
                    this.curChar = 0;

                    try {
                        this.numChars = this.stream.read(this.buf);
                    } catch (IOException var2) {
                        throw new InputMismatchException();
                    }

                    if (this.numChars <= 0) {
                        return -1;
                    }
                }

                return this.buf[this.curChar++];
            }
        }

        public int nextInt() {
            int c;
            for (c = this.read(); isSpaceChar(c); c = this.read()) {
                ;
            }

            byte sgn = 1;
            if (c == 45) {
                sgn = -1;
                c = this.read();
            }

            int res = 0;

            while (c >= 48 && c <= 57) {
                res *= 10;
                res += c - 48;
                c = this.read();
                if (isSpaceChar(c)) {
                    return res * sgn;
                }
            }

            throw new InputMismatchException();
        }

        public String next() {
            int c;
            while (isSpaceChar(c = this.read())) {
                ;
            }

            StringBuilder result = new StringBuilder();
            result.appendCodePoint(c);

            while (!isSpaceChar(c = this.read())) {
                result.appendCodePoint(c);
            }

            return result.toString();
        }

        public static boolean isSpaceChar(int c) {
            return c == 32 || c == 10 || c == 13 || c == 9 || c == -1;
        }

    }

    static class OutputWriter {
        private final PrintWriter writer;

        public OutputWriter(OutputStream outputStream) {
            writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));
        }

        public OutputWriter(Writer writer) {
            this.writer = new PrintWriter(writer);
        }

        public void printf(String format, Object... objects) {
            writer.printf(format, objects);
        }

        public void close() {
            writer.close();
        }

    }


}