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.*;

public class Main {

    static int valid(String str,int s){
        int sum = 0;
        for(int i=0;i<str.length();i++){
            sum += (str.charAt(i) - '0');
            if(sum>s){
                return i;
            }
        }
        return -1;
    }

    static boolean isSmaller(String str1, String str2)
    {
        // Calculate lengths of both string
        int n1 = str1.length(), n2 = str2.length();
        if (n1 < n2)
            return true;
        if (n2 < n1)
            return false;

        for (int i = 0; i < n1; i++)
            if (str1.charAt(i) < str2.charAt(i))
                return true;
            else if (str1.charAt(i) > str2.charAt(i))
                return false;

        return false;
    }

    static String findDiff(String str1, String str2)
    {
        // Before proceeding further, make sure str1
        // is not smaller
        if (isSmaller(str1, str2)) {
            String t = str1;
            str1 = str2;
            str2 = t;
        }

        // Take an empty string for storing result
        String str = "";

        // Calculate length of both string
        int n1 = str1.length(), n2 = str2.length();

        // Reverse both of strings
        str1 = new StringBuilder(str1).reverse().toString();
        str2 = new StringBuilder(str2).reverse().toString();

        int carry = 0;

        // Run loop till small string length
        // and subtract digit of str1 to str2
        for (int i = 0; i < n2; i++) {
            // Do school mathematics, compute difference of
            // current digits
            int sub
                    = ((int)(str1.charAt(i) - '0')
                    - (int)(str2.charAt(i) - '0') - carry);

            // If subtraction is less then zero
            // we add then we add 10 into sub and
            // take carry as 1 for calculating next step
            if (sub < 0) {
                sub = sub + 10;
                carry = 1;
            }
            else
                carry = 0;

            str += (char)(sub + '0');
        }

        // subtract remaining digits of larger number
        for (int i = n2; i < n1; i++) {
            int sub = ((int)(str1.charAt(i) - '0') - carry);

            // if the sub value is -ve, then make it
            // positive
            if (sub < 0) {
                sub = sub + 10;
                carry = 1;
            }
            else
                carry = 0;

            str += (char)(sub + '0');
        }

        // reverse resultant string
        StringBuilder sb = new StringBuilder(str);
        while(sb.charAt(sb.length()-1) =='0' && sb.length()>1){
            sb.deleteCharAt(sb.length()-1);
        }
        return sb.reverse().toString();
    }

    public static void main(String[] args){
        MyScanner sc = new MyScanner();
        long t = sc.nextInt();
        while(t-->0){
            long n = sc.nextLong();
            int s = sc.nextInt();
            StringBuilder sb = new StringBuilder(n+"");
            int i = valid(sb.toString(),s);
            while(i != -1){
                for(int c=i;c<sb.toString().length();c++){
                    sb.setCharAt(c,'0');
                }
                boolean cont = true;
                for(int c=i-1;c>=0;c--){
                    if(!cont){
                        break;
                    }
                    int crnt = sb.charAt(c) - '0';
                    if(crnt < 9){
                        crnt++;
                        String ss = crnt+"";
                        sb.setCharAt(c,ss.charAt(0));
                        cont = false;
                    }else{
                        sb.setCharAt(c,'0');
                    }
                }
                if(cont){
                    sb.insert(0,'1');
                    cont = false;
                }
                i = valid(sb.toString(),s);
            }
            System.out.println(findDiff(sb.toString(), n+""));
        }
    }








    public static class MyScanner {
        BufferedReader br;
        StringTokenizer st;

        public MyScanner() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        long nextLong() {
            return Long.parseLong(next());
        }

        double nextDouble() {
            return Double.parseDouble(next());
        }

        String nextLine(){
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }

    }

}