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 final class test {
    public static void main(String[] args) {
        FastScanner sc = new FastScanner(System.in);
        int t = sc.nextInt();
        StringBuilder ans = new StringBuilder("");

        while (t-- != 0) {  
            long n = sc.nextLong();
            int s = sc.nextInt();

            long sum = sumOfDigits(n);
            if (sum <= s) {
                ans.append("0" + "\n");
            }
            else {
                long cost = 0;
                long difference = sum - s;
                String sx = "" + n;
                char num[] = sx.toCharArray();
                long count = 1;

                for (int i = num.length-1 ; i >= 0; i--) {
                    int curr = num[i] - '0';
                    if (num[i] > 0) {
                        long tz = 10 - (num[i] - '0');
                        cost +=  (tz * count);
                        if (i != 0) num[i-1] += 1;  
                        sum = sum - curr + 1;
                        count = count * 10;

                    }
                    if (sum <= s) {
                        ans.append(cost + "\n");
                        break;
                    }
                }
            }
        }
        System.out.println(ans);
    }

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

 class FastScanner {
        BufferedReader br;
        StringTokenizer st;

        public FastScanner(InputStream stream) {
            br = new BufferedReader(new InputStreamReader(stream));
        }

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

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

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

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

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

        public int[] readArray(int n) {
            int[] a = new int[n];
            for (int i = 0; i < n; i++) a[i] = nextInt();
            return a;
        }
}