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.HashSet;
import java.util.PriorityQueue;
import java.util.StringTokenizer;

public class D{
	
	
	
	public static void main(String[] args) throws IOException {
		
		
		FastScanner sc=new FastScanner();
		int t = sc.nextInt();
		first : while(t-- != 0) {
			String str = sc.next();
			int len = str.length();
			int s = sc.nextInt();
			if(len == 1) {
				if(Integer.parseInt(str) <= s) {
					System.out.println(0);
					continue first;
				}
			}
			
			int sum = 0;
			int count = 0;
			while(sum <= s && count < len) {
				sum += Integer.parseInt(""+str.charAt(count));
				count++;
			}
			if(sum <= s) {
				System.out.println(0);
				continue;
			}
			sum-=Integer.parseInt(""+str.charAt(count-1));
			if(sum == s) {
				sum = 0;
				count = 0;
				while(sum < s && count < len) {
					sum += Integer.parseInt(""+str.charAt(count));
					count++;
				}
				
			}
			else
				sum+=Integer.parseInt(""+str.charAt(count-1));
			String ss = "";
			ss = str.substring(count-1);
			//System.out.println(ss);
			int length = ss.length();
			String xxx = "1";
			while(length-- != 0)
				xxx+="0";
			
			long value = Long.parseLong(xxx) -  Long.parseLong(ss);
			System.out.println(value);
			
			
        }
		
		
	}
	
	
	
	
 
	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());
		}
	}
}