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.BufferedWriter;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.io.Writer;
import java.util.ArrayList;
import java.util.HashSet;
import java.util.InputMismatchException;
import java.util.List;
import java.util.Set;

public class Codeforces {

    long a[];
    int n;

    public void solve() {
        InputReader in = new InputReader(System.in);
        OutputWriter out = new OutputWriter(System.out);
        int t = in.readInt();
        while (t-- > 0) {
            long n1 = in.readLong();
            int s = in.readInt();
            char st[] = String.valueOf(n1).toCharArray();
            int n = st.length;
            int currSum = 0;
            for (int i = n - 1; i >= 0; i--) {
                currSum += (st[i] - '0');
            }
            if ( currSum <= s ) {
                out.printLine(0);
            } else {
                int diff = currSum - s;
                for (int i = n - 1; i >= 0 && diff > 0; i--) {
                    if ( diff > 0) {
                        diff -= st[i] - '0';
                        st[i] = '0';
                        int temp = i-1;
                        while(temp>=0 && st[temp]=='9'){
                            st[temp]='0';
                            temp--;
                            diff-=9;
                        }
                        if(temp<0) {
                            diff=1;
                            break;
                        }else{
                            diff++;
                            st[temp]++;
                        }
                    } /*else {
                        st[i] = '0';

                        if ( i > 0 )
                            diff = 0;
                        break;
                    }*/
                }
                StringBuilder sb;
                if ( diff > 0 ) {
                    sb = new StringBuilder("1").append(st);
                } else {
                    sb = new StringBuilder();
                    sb.append(st);
                }
                long val = Long.valueOf(sb.toString());
//                for (int i = n - 1; i >= 0; i--) {
//                    val = val * 10 + (sb.charAt(i) - '0');
//                }
                out.printLine(Math.abs(val - n1));
            }
        }
        out.flush();
    }

    private long calCost(long c) {
        long cost = 0;
        long cur = 1;
        for (int i = 0; i < n; i++, cur = cur * c) {
            cost += Math.abs(a[i] - cur);
        }
        return cost;
    }

    private long search() {
        long st = 1;
        long end = (long) Math.pow((long) 1e18, 1.0 / n);
        long mid = 0;
        while (st <= end) {
            mid = st + (end - st) / 2;
            long cur = calCost(mid);
            long left = calCost(mid - 1);
            long right = calCost(mid + 1);
            if ( left > cur && cur < right ) {
                return cur;
            }
            if ( cur > left ) {
                end = mid - 1;
            } else st = mid + 1;
        }
        return calCost(mid);
    }

    public static void main(String[] args) {
        Codeforces solver = new Codeforces();
//        System.out.println(217871987498122L + 2128012501878L);
        solver.solve();
    }

    static class InputReader {

        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;
        private SpaceCharFilter filter;

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

        public int read() {
            if ( numChars == -1 )
                throw new InputMismatchException();
            if ( curChar >= numChars ) {
                curChar = 0;
                try {
                    numChars = stream.read(buf);
                } catch (IOException e) {
                    throw new InputMismatchException();
                }
                if ( numChars <= 0 )
                    return -1;
            }
            return buf[curChar++];
        }

        public int readInt() {
            int c = read();
            while (isSpaceChar(c))
                c = read();
            int sgn = 1;
            if ( c == '-' ) {
                sgn = -1;
                c = read();
            }
            int res = 0;
            do {
                if ( c < '0' || c > '9' )
                    throw new InputMismatchException();
                res *= 10;
                res += c - '0';
                c = read();
            } while (!isSpaceChar(c));
            return res * sgn;
        }

        public long readLong() {
            int c = read();
            while (isSpaceChar(c))
                c = read();
            int sgn = 1;
            if ( c == '-' ) {
                sgn = -1;
                c = read();
            }
            long res = 0;
            do {
                if ( c < '0' || c > '9' )
                    throw new InputMismatchException();
                res *= 10;
                res += c - '0';
                c = read();
            } while (!isSpaceChar(c));
            return res * sgn;
        }

        public String readString() {
            int c = read();
            while (isSpaceChar(c))
                c = read();
            StringBuilder res = new StringBuilder();
            do {
                res.appendCodePoint(c);
                c = read();
            } while (!isSpaceChar(c));
            return res.toString();
        }

        public boolean isSpaceChar(int c) {
            if ( filter != null )
                return filter.isSpaceChar(c);
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

        public String next() {
            return readString();
        }

        public interface SpaceCharFilter {
            public boolean isSpaceChar(int ch);
        }
    }

    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 print(Object... objects) {
            for (int i = 0; i < objects.length; i++) {
                if ( i != 0 )
                    writer.print(' ');
                writer.print(objects[i]);
            }
        }

        public void printLine(Object... objects) {
            print(objects);
            writer.println();
        }

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

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

    }

    static class IOUtils {

        public static int[] readIntegerArray(InputReader in, int size) {
            int[] array = new int[size];
            for (int i = 0; i < size; i++) {
                array[i] = in.readInt();
            }
            return array;
        }

        public static long[] readLongArray(InputReader in, int size) {
            long[] array = new long[size];
            for (int i = 0; i < size; i++) {
                array[i] = in.readLong();
            }
            return array;
        }

        public static List<Integer> readIntegerList(InputReader in, int size) {
            List<Integer> set = new ArrayList<>();
            for (int i = 0; i < size; i++) {
                set.add(in.readInt());
            }
            return set;
        }

        public static Set<Integer> readIntegerSet(InputReader in, int size) {
            Set<Integer> set = new HashSet<Integer>();
            for (int i = 0; i < size; i++) {
                set.add(in.readInt());
            }
            return set;
        }
    }
}