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.*;
import java.util.*;
public class Main
{
	public static void main(String[] args)throws Exception
	{
	    BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
	    PrintWriter pw=new PrintWriter(System.out);
	    int t=Integer.parseInt(br.readLine());
	    while(t-->0)
	    {
	        String s[]=(br.readLine()).split(" ");
	        long n=Long.parseLong(s[0]);
	        long x=Long.parseLong(s[1]);
	        int dig=0;
	        long temp=n;
	        long sum=0l;
	        while(temp!=0)
	        {
	            dig+=1;
	            sum+=temp%10l;
	            temp/=10l;
	        }
	        int a1[]=new int[dig];
	        int a2[]=new int[dig];
	        temp=n;
	        int in=dig-1;
	        while(temp!=0l)
	        {
	            a1[in]=(int)(temp%10l);
	            temp/=10l;
	            in--;
	        }
	        if(sum<=x)
	        {
	            pw.println(0);
	            continue;
	        }
	        int carry=0;
	        for(int i=dig-1;i>=0;i--)
	        {
	            if(a1[i]==0)
	            {
	                carry=0;
	                continue;
	            }
	            if(a1[i]==10)
	            {
	                sum-=9;
	                a2[i]=0;
	                if(i>0)
	                {
	                    a1[i-1]+=1;
	                    carry=1;
	                }
	                continue;
	            }
	            else
	            {
	                
	                sum+=carry;
	            }
	            if(sum<=x)
	            {
	                break;
	            }
	            
	            
	            a2[i]=10-a1[i];
	            carry=1;
	            sum-=a1[i];
	            if(i>0)
	            {
	                a1[i-1]+=1;
	            }
	            
	        }
	        
	        boolean found=false;
	        for(int i=0;i<dig;i++)
	        {
	            if(!found)
	            {
	                if(a2[i]!=0)
	                {
	                    found=true;
	                }
	            }
	            if(found)
	            {
	                pw.print(a2[i]);
	            }
	            
	        }
	        pw.println();
	    }
	    pw.flush();
	}
}