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.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Collections;
import java.util.StringTokenizer;

public class practiceJAVA {

    public static void main(String[] args) throws IOException {
        inp.init();
        long t=inp.nextInt();
        while(t-->0) {
            long n = inp.nextLong();
            long s = inp.nextInt();
            long ans = 0;
            long tmp = n;

            tmp=n;
            long i=1;
            while(f(tmp)>s){
//                System.out.println("tmp "+tmp);

                long d = tmp%10;
                if(d==0){
                    tmp/=10;
                    i*=10;
                    continue;
                }
                ans+=((10-d)*i);
                tmp/=10;
                tmp+=1;
                i*=10;
//                System.out.println("ans");
//                System.out.println(i+" "+ans);
            }

            System.out.println(ans);

        }
    }

    static long f(long tmp){
        long sum=0;
        for(long i=1;i<=18;i++){
            sum+=tmp%10;
            tmp/=10;
        }
        return sum;
    }
}

class inp {
    static BufferedReader reader;
    static StringTokenizer tokenizer;

    static void init() {
        reader = new BufferedReader(
                new InputStreamReader(System.in) );
        tokenizer = new StringTokenizer("");
    }
    static String next() throws IOException {
        while ( ! tokenizer.hasMoreTokens() ) {
            tokenizer = new StringTokenizer(
                    reader.readLine() );
        }
        return tokenizer.nextToken();
    }
    static int nextInt() throws IOException {
        return Integer.parseInt( next() );
    }
    static double nextDouble() throws IOException {
        return Double.parseDouble( next() );
    }
    static long nextLong() throws IOException {
        return Long.parseLong( next() );
    }
}