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.util.Scanner;

public class A {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int t = scanner.nextInt();
        for (int j = 0; j < t; j++) {
            long n = scanner.nextLong();
            long s = scanner.nextLong();

            long num = n;
            int count = 0;
            long sum = 0;
            long[] digit = new long[20];
            while (num > 0) {
                digit[count++] = num % 10;
                sum += digit[count - 1];
                num /= 10;
            }
            int countReserve = count;
            count = 0;
            while (sum > s) {
                sum -= digit[count] - 1;
                digit[count] = 0;
                digit[++count]++;
                while (digit[count] == 10) {
                    digit[count] = 0;
                    digit[++count]++;
                    sum -= 9;
                }
                //System.out.println(Arrays.toString(digit));
            }

            long result = 0;
            for (int i = countReserve; i >= 0; i--) {
                result = result * 10 + digit[i];
            }
            //System.out.println(Arrays.toString(digit));
            System.out.println(result - n);

        }
    }
}