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 D {
    public static long fuck(String line) {
        long sum = 0;
        for(int k = 0; k < line.length(); k++) {
            sum += Long.parseLong(line.substring(k, k + 1));
        }
        return sum;
    }
    public static void main(String[] args) {
        Scanner input = new Scanner(System.in);
        int t = input.nextInt();
        input.nextLine();
        for(int i = 0; i < t; i++) {
            String[] line = input.nextLine().split(" ");
            long n = Long.parseLong(line[0]);
            long s = Long.parseLong(line[1]);
            long moves = 0;
            long total = 0;
            long multiplier = 1;
            int sum = 0;
            for(int k = 0; k < line[0].length(); k++) {
                sum += Integer.parseInt(line[0].substring(k, k + 1));
            }
            for(int k = line[0].length() - 1; k >= 0; k--) {
                String temp = Long.toString(n);
                long cur = Long.parseLong(temp.substring(k, k + 1));
                if(fuck(temp) <= s) {
                    break;
                }
                if(cur != 0) {
                    moves = multiplier * (10 - cur);
                    total += moves;
                    n += moves;
                }
                multiplier *= 10;
            }
            System.out.println(total);
        }
    }
}