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 Solution{
    Scanner in = new Scanner(System.in);
    private void solve(long a, int sum) {
        if (sum(a) <= sum) {
            System.out.println(0);
            return;
        }
        long d = 10;
        while(true) {
            long b = (a / d + 1) * d;
            if (sum(b) <= sum) {
                System.out.println(b - a);
                return;
            }
            d *= 10;
        }
    }
    
    private int sum(long num) {
        int res = 0;
        while (num != 0) {
            res += num % 10;
            num /= 10;
        }
        return res;
    }

    public static void main(String []args){
        Solution solution = new Solution();
        int testCnt = solution.readInt();
        for (int i = 0; i < testCnt; i++) {
            long arg1 = solution.readLong();
            int arg2 = solution.readInt();
            solution.solve(arg1, arg2);
        }
    }
    
    private int readInt(){
        return in.nextInt();
    }
    
    private long readLong(){
        return in.nextLong();
    }
    
    private int[] readIntArray(int size){
        int[] res = new int[size];
        for (int i = 0; i < size; i++) {
            res[i] = in.nextInt();
        }
        return res;
    }
}