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 Solution{
	public static void main(String args[]){
		Scanner sc=new Scanner(System.in);
		int i,n;
		int t=sc.nextInt();
		while(t-->0){
			char s[]=sc.next().toCharArray();
			int sum=sc.nextInt();
			int a[]=new int[s.length];
			n=s.length;
			int psum=0;
			for(i=0;i<n;i++){
				a[i]=s[i]-'0';
				psum+=a[i];
			}
			if(psum<=sum){
				System.out.println(0);
				continue;
			}
			long ans=0;
			int flag=0;
			int carry;
			for(i=n-1;i>=0;i--){
				if(a[i]==0)
					continue;
				long diff=10-a[i];
				ans+=(long)Math.pow(10,n-1-i)*diff;
				psum=psum-a[i]+1;
				if(i!=0)
					a[i-1]+=1;
				else
					carry=1;
				if(psum<=sum){
					flag=1;
					break;
				}
			}
			System.out.println(ans);
		}
	}
}