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 Solution{
	static PrintWriter out=new PrintWriter(System.out);
	public static void main (String[] args) throws IOException{
		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
		
		String[] input=br.readLine().trim().split(" ");
		
		int numTestCases=Integer.parseInt(input[0]);
		while(numTestCases-->0){
		    input=br.readLine().trim().split(" ");
		    long n=Long.parseLong(input[0]);
		    int s=Integer.parseInt(input[1]);
    		
    		out.println(minSteps(n,s));
		}
		
		out.flush();
		out.close();
	}
	public static long minSteps(long n,int s)
	{
		int sum=sum(n);
		if(sum<=s) {
			return 0;
		}
		StringBuilder str=new StringBuilder(Long.toString(n));
		if(s==1) {
			int len=str.length();
			str=new StringBuilder("1");
			for(int i=0;i<len;i++) {
				str.append("0");
			}
			long temp=Long.parseLong(str.toString());
			sum=sum(temp);
			return temp-n;
		}
		for(int i=str.length()-2;i>=0;i--) {
			for(char digit='1';digit<='9';digit++) {
				if(str.charAt(i)>=digit)
				{
					continue;
				}
				str.setCharAt(i, digit);
				for(int j=i+1;j<str.length();j++) {
					str.setCharAt(j, '0');
				}
				long temp=Long.parseLong(str.toString());
				sum=sum(temp);
				if(sum<=s) {
					return temp-n;
				}
				str=new StringBuilder(Long.toString(n));
			}
		}
		int len=str.length();
		str=new StringBuilder("1");
		for(int i=0;i<len;i++) {
			str.append("0");
		}
		long temp=Long.parseLong(str.toString());
		sum=sum(temp);
		return temp-n;
	}
	public static int sum(long x)
	{
		long sum=0;
		long temp=x;
		while(temp>0) {
			long digit=temp%10;
			sum+=digit;
			temp/=10;
		}
		return (int)sum;
	}
}