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.*;
import java.io.*;
public class Main  {
    public static void main(String args[]) {
      FastScanner fs=new FastScanner();    
      PrintWriter out=new PrintWriter(System.out);
        
        int t=fs.nextInt();
        while(t-->0)
        {
            String s1=fs.next();
            int s=fs.nextInt();
            int i=s1.length()-1;
            char ch;
            int mov;
            char chp=0;
            String ans="";
            StringBuffer sb=new StringBuffer(s1);
            
            while(sum(sb)>s && i>=0)
            {
                ch=sb.charAt(i);
                mov=(10-(ch-'0'))%10;
                ans+=(int)mov;
                sb.replace(i,i+1,"0");
                if(mov>0)
                {
                    int k=i-1;
                    if(k>=0)
                    chp=sb.charAt(k);
                    chp++;
                while(chp==58)
                {
                    chp=48;
                    if(k>=0)
                    sb.replace(k,k+1,String.valueOf(chp));
                 k--;
                 if(k<0)
                 break;
                 chp=sb.charAt(k);
                 chp++;
                }
                    if(k>=0)
                   sb.replace(k,k+1,String.valueOf(chp));
                }
                i--;
            }
            if(ans.equals(""))
            ans="0";
            out.println(new StringBuffer(ans).reverse());
        }
        
        out.flush();
        out.close();
    }
    static int sum(StringBuffer str)
    {
        int sum=0;
        
        for(int i=0;i<str.length();i++)
        {
            sum+=str.charAt(i)-'0';
        }
        return sum;
    }
	static void ruffleSort(int[] a) {
 		Random random=new Random();
		int n=a.length;
		for (int i=0; i<n; i++) {
			int oi=random.nextInt(n), temp=a[oi];
			a[oi]=a[i]; a[i]=temp;
		}
		Arrays.sort(a);
	}
}
        class FastScanner {
		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st=new StringTokenizer("");
		
		String next() {
			while (!st.hasMoreTokens())
				try {
				st=new StringTokenizer(br.readLine());
				}
				catch (IOException e) {
					e.printStackTrace();
				}
			return st.nextToken();
		}
		String nextLine() {
		    String str="";
		    try {
		        str=br.readLine();
		    }
		    catch (IOException e) {
		        e.printStackTrace(); 
		    }
		    return str;
		}
		int nextInt() {
			return Integer.parseInt(next());
		}
		double nextDouble() {
		    return Double.parseDouble(next());
		}
		long nextLong() {
			return Long.parseLong(next());
		}
		int[] readArray(int n) {
			int[] a=new int[n];
			for (int i=0; i<n; i++) a[i]=nextInt();
			return a;
		}
	}