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 d667 {
    public static int sumDig(long n) {
        int res = 0;
        while (n > 0) {
            res += n % 10;
            n /=10;
        }
        return res;

    }

    public static void main (String[] args){
        Scanner sc = new Scanner(System.in);
        int T = sc.nextInt();

        while (T -->0){
            long n = sc.nextLong();
            int s = sc.nextInt();
            if (sumDig(n) <= s) System.out.println(0);
            else {
                String str = ""+n;
                int curSum = 0;
                for (int i = 0; i < str.length(); i++) {
                    int c = str.charAt(i)- '0';
                    if (curSum + c < s) curSum+=c;
                    else {
                        // go back one sq and take out the rest
                        String res = str.substring(i, str.length());
                        long residue = Long.parseLong(res);
                        long bigger = (long)Math.pow(10,res.length());
                        System.out.println(bigger-residue);
                        break;
                    }
                }
            }
        }
    }
}