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.*;
import java.util.*;

public class Main {

	
	public static void main(String[] args) {
		FastScanner in=new FastScanner();
		PrintWriter out=new PrintWriter(System.out);
	    int t=in.nextInt();
		while(t-->0)
		solve(in,out);
		out.close();
	}
    static long n,s,ans;

    static void solve(FastScanner in,PrintWriter out){
     n=in.nextLong();
     s=in.nextLong();
     long temp=n;
        int sum=0;
        while(temp!=0){
            sum+=temp%10;
            temp/=10;
        }
        if(sum<=s) { out.println("0"); return; }
        sum-=s;
        temp=n;
        long ans=0;
        long prev=0,tt=1;
        while(sum!=0){
            long p=temp%10;
            if(prev==1){ p++; prev=0; }
            if(p==0){ tt*=10; temp/=10; continue; }
            if(p==1){ ans+=tt*9; prev=1; tt*=10; temp/=10; continue; }
            if(sum>p-1){
                sum-=p;  sum++; prev=1;
                ans+=(10-p)*tt;
            }
            else{
                ans+=(10-p)*tt;
                sum=0;
            }
            tt*=10;
            temp/=10;
        }
     out.println(ans);
    }    
	


	static void sort(int[] a) {
		ArrayList<Integer> l=new ArrayList<>();
		for (int i:a) l.add(i);
		Collections.sort(l);
		for (int i=0; i<a.length; i++) a[i]=l.get(i);
	}
	
	static 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();
		}
		
		int nextInt() {
			return Integer.parseInt(next());
		}
		int[] readArray(int n) {
			int[] a=new int[n];
			for (int i=0; i<n; i++) a[i]=nextInt();
			return a;
		}
		long nextLong() {
			return Long.parseLong(next());
		}
	}

	
}