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

public class Main
{
	public static void main (String[] args) throws IOException
	{
		BufferedReader br =  new BufferedReader(new InputStreamReader(System.in));
		
		int tc = Integer.parseInt(br.readLine());
		
		while(tc-->0){
		    StringTokenizer st = new StringTokenizer(br.readLine());
		    long n = Long.parseLong(st.nextToken());
		    int s = Integer.parseInt(st.nextToken());
		    
		    
		    if(sumd(n)<=s) System.out.println(0); 
		    
		    else{
		        boolean fnz=false;
		        StringBuilder t = new StringBuilder();
		        while(sumd(n)>s){
		            if(!fnz&&10-(n%10) == 10){
		                n/=10;
		                t.insert(0,0);
		            }else{
		                t.insert(0,10-(n%10));
		                n/=10;
		                n++;
		                
		            }
		            
		        }
		        System.out.println(t);
		    }
		}
		
		br.close();
	}
	public static long sumd(long n){
	    long sum=0;
	    while(n>0){
	        sum+=n%10;
	        n/=10;
	    }
	    return sum;
	}
}