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 {

    public static int sum(long m){
        int s = 0;
        while (m>0){
            int r = (int)(m%10);
            m /= 10;
            s += r;
        }
        return s;
    }
    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        int t = scan.nextInt();
        while(t-->0){
            long n = scan.nextLong();
            int s = scan.nextInt();
            long m = 0;
            long pos = 1;
            while (sum(n) > s){
                int r = (int) (n%10);
                n += (10-r);
                m += (10-r)*pos;
                n /= 10;
                pos *= 10;
            }
            System.out.println(m);
        }
    }
}