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.*;
import java.math.*;
public class Euler {
	
	
	public static int sum(long n) {
		int res = 0;
		while(n > 0) {
			res += n % 10;
			n /= 10;
		}
		return res;
	}
	
	
	
    public static void main(String[] args){

        FastReader in = new FastReader();
        PrintWriter o = new PrintWriter(System.out);
        
        int t = in.nextInt();
        
        while (t-- > 0) {
			
			long n = in.nextLong();
			int  s = in.nextInt();
			
			if (sum(n) <= s) {
				o.println("0");
				continue;
			}
			
			long pw = 1;
			long ans = 0;
			
			for (int i = 0; i < 18; i++) {
				
				int digit = (int) ((n / pw) % 10);
				long add = pw * ((10 - digit));
				n += add;
				ans += add;
				if (sum(n) <= s) {
					break;
				}
				pw *= 10;
				
			}
			
			o.println(ans);
			
			
			
		}
			
			
        
        o.close();
        o.flush();
        return;



    }


    static class FastReader {
        BufferedReader br;
        StringTokenizer st;

        public FastReader() {
            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;
        }
    }


}