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

public class codeforces667_D {
    private static void solve(FastIOAdapter ioAdapter) {
        long n = ioAdapter.nextLong();
        int s = ioAdapter.nextInt();

        int curSum = getCurSum(n);
        if (curSum > s) {
            long pw = 1;
            long ans = 0;
            for (int i = 0; i < 18; i++) {
                long curDigit = (n / pw) % 10;
                long toAdd = pw * ((10 - curDigit) % 10);
                n += toAdd;
                ans += toAdd;
                if (getCurSum(n) <= s) {
                    break;
                }
                pw *= 10;
            }
            ioAdapter.out.println(ans);

        } else {
            ioAdapter.out.println(0);
        }
    }

    private static int getCurSum(long n) {
        int curSum = 0;
        while (n != 0) {
            curSum += n % 10;
            n /= 10;
        }
        return curSum;
    }

    public static void main(String[] args) throws Exception {
        try (FastIOAdapter ioAdapter = new FastIOAdapter()) {
            int count = 1;
            count = ioAdapter.nextInt();
            while (count-- > 0) {
                solve(ioAdapter);
            }
        }
    }

    static class FastIOAdapter implements AutoCloseable {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        public PrintWriter out = new PrintWriter(new BufferedWriter(new OutputStreamWriter((System.out))));
        StringTokenizer st = new StringTokenizer("");

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

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

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

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

        @Override
        public void close() throws Exception {
            out.flush();
            out.close();
            br.close();
        }
    }
}