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.*;


public class Code {

	
	
	static int sum(long n)
	{
		int res=0;
		long temp=n;
		 while(temp>0)
    	 {
    		 res+=temp%10;
    		 temp=temp/10;
    	//	 System.out.println("  "+temp);
    	 }

		return res;
	}
		public static void main(String[] args)
	{
		
		Scanner sc=new Scanner(System.in);
	    int t=sc.nextInt();
	    while(t-->0)
	    {
	    	 long n=sc.nextLong();
	    	 int s=sc.nextInt();
	    	 if(sum(n)<=s)
	    	 {
	    		 System.out.println(0);
	    		 continue;
	    	 }
	    	 long ans=0;
	    	 long p=1;
	    	 for(int i=0;i<18;i++)
	    	 {
	    		long digit=(n/p)%10;
	    		long add=(10-digit)%10;
	    		//System.out.println(p);
	    		ans+=add*p;
	    		n+=add*p;
	    		if(sum(n)<=s)
	    		{
	    			break;
	    		}
	    		p*=10;
	    	 }
	    	 System.out.println(ans);
	    	
	    }
	    
		}
			
}