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.Scanner;
public class task{
public static void main(String[] args) {
	Scanner in = new Scanner(System.in);
	int n = in.nextInt();
	int[][] arr = new int[n][2];
	for(int i = 0 ;i<n;i++){
		arr[i][0]=in.nextInt();
		arr[i][1]=in.nextInt();
	}
    int sum=0;
 
    for (int i = 0;i<n ;i++ ) {
    	if(arr[i][0]%arr[i][1]==0){
    		System.out.println("0");
    	}
    	else{
    	System.out.println(arr[i][1]-arr[i][0]%arr[i][1]);
}
  }
  
    }
}