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 EdC {

	public static void main(String[] args) throws Exception{
		int num = 998244353;

		// TODO Auto-generated method stub
 		BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
 		PrintWriter out = new PrintWriter(System.out);
 		int t = Integer.parseInt(bf.readLine());
 		for(int i = 0;i<t;i++){
//	 		String input1 = bf.readLine().trim();
//	 		String input2 = bf.readLine().trim();
	 		StringTokenizer st = new StringTokenizer(bf.readLine());
	 		String number = st.nextToken();
	 		long n = Long.parseLong(number);
	 		int s = Integer.parseInt(st.nextToken());
	 		int curr = 0;
	 		long temp = n;
	 		while(temp!= 0){
	 			curr+=(temp%10);
	 			temp/=10L;
	 		}
	 		if (curr <= s)
	 			out.println(0);
	 		else if (Integer.parseInt(number.charAt(0)+"") >= s){
	 			long prod = 1;
	 			for(int j = 0;j<number.length();j++){
	 				prod*=10L;
	 			}
	 			out.println(prod-n);
	 		}
	 		else{
	 			int j = 0;
	 			long answer = 0;
	 			long subt = 1;
	 			for(j = number.length()-2;j>=0;j--){
	 				curr-=Integer.parseInt(number.charAt(j+1)+"");
	 				answer+= Long.parseLong(number.charAt(j+1)+"")*subt;
	 				subt*=10L;
	 				
	 				if (number.charAt(j) != '9' && curr+1 <= s)
	 					break;
	 			}
	 			
	 			out.println(subt-answer);
	 			
	 			
	 		}

 		}
 		
 		
 		out.println();
	 		
 		out.close();
 		
 		
 		
 	}
}
 	
 
//StringJoiner sj = new StringJoiner(" "); 
//sj.add(strings)
//sj.toString() gives string of those stuff w spaces or whatever that sequence is