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

public class Q4 {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int ntest = scanner.nextInt();
        for (int p = 0; p < ntest; p++) {
            func(scanner);
        }

    }

    public static void func(Scanner scanner) {
        long a = scanner.nextLong();
        long sum = scanner.nextLong();
        long operations = 0;
        long i = 0;
        while (getSum(a) > sum) {
            long digit = (a / (long) Math.pow(10, i)) % 10;
            long multfactor = (long) Math.pow(10, i);
            long nadd = ((10 - digit) % 10) * multfactor;
            operations += nadd;
            a += nadd;
            i++;

        }
        System.out.println(operations);

    }

    public static long getSum(long n) {
        int sum = 0;

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

    }
}