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.math.BigInteger;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int t = sc.nextInt();
        while (t-- > 0) {
            BigInteger n = sc.nextBigInteger();
            int s = sc.nextInt();
            BigInteger[] p = new BigInteger[20];
            p[0] = BigInteger.valueOf(1);
            for (int i = 1; i <= 18; i++) {
                p[i] = p[i - 1].multiply(BigInteger.valueOf(10));
            }
            int[] num = new int[20];
            int cnt = 0;
            int sum = 0;
            BigInteger tmp = n;
            while (tmp.compareTo(BigInteger.ZERO) != 0) {
                num[++cnt] = tmp.remainder(BigInteger.valueOf(10)).intValue();
                sum = sum + tmp.remainder(BigInteger.valueOf(10)).intValue();
                tmp = tmp.divide(BigInteger.valueOf(10));
            }
            if (sum <= s) {
                System.out.println(0);
                continue;
            }
            tmp = n;

            for (int i = 1; i <= cnt; i++) {
                sum -= num[i];
                tmp = tmp.subtract(p[i - 1].multiply(BigInteger.valueOf(num[i])));
                if (num[i + 1] != 9 && sum + 1 <= s) {
                    tmp =tmp.add(p[i]) ;
                    System.out.println(tmp.subtract(n));
                    break;
                }
            }


        }
    }
}