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 Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        long t = scanner.nextInt();
        for (long i = 0; i < t; i++) {
            long n = scanner.nextLong();
            int s = scanner.nextInt();
            System.out.println(count(n, s));
        }
    }

    private static long count(long n, int s) {
        long add = 0;
        long index = 0;
        boolean is = calcSumOfDigits(n) > s;
        while (is) {
            long ithDigit = getIthDigit(n, index++);
            if (ithDigit != 0) {
                long v = (long) Math.pow(10, index - 1) * (10 - ithDigit);
                add += v;
                n += v;
            }
            is = calcSumOfDigits(n) > s;
        }
        return add;
    }

    private static long getIthDigit(long n, long i) {
        if (i == 0) return n % 10;
        else return getIthDigit(n / 10, i - 1);
    }

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