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 Tester {
    public static void main(String[] args){
        Scanner input = new Scanner(System.in);
        int t = input.nextInt();
        for(int testCase = 1; testCase <= t; testCase++){
            long n = Long.valueOf(input.next());
            long s = Long.valueOf(input.next());
            
            long moves;
            if(n <= s || (s >= sumOfAllDigits(n))){
                moves = 0;
            }else if(s == 1){
                long target = 1;
                for(long i = n; i > 0; i /= 10){
                    target *= 10;
                }
                moves = target - n;
            }else{
                long nonZeroDigit = 1;
                long target = -1;
                for(long i = n; i > 0; i /= 10){
                    if(sumOfAllDigits(i + 1) <= s && (i + 1) % 10 != 0){
                        target = (i + 1) * nonZeroDigit;
                        break;
                    }
                    nonZeroDigit *= 10;
                }
                if(target == -1){
                    target = nonZeroDigit;
                }
                moves = Math.abs(n - target);
            }
            System.out.println(moves);
        }
    }
    
    private static long sumOfAllDigits(long x){
        long num = 0;
        while(x > 0){
            num += x % 10;
            x /= 10;
        }
        return num;
    }
}