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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.HashSet;
import java.util.Set;

public class LongInteger2 {

	public static void main(String[] args) throws NumberFormatException, IOException {
		
		BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
		int t = Integer.parseInt(reader.readLine());
		while (t-- > 0) {
			String input = reader.readLine();
			String[] splits = input.split(" ");
			long result = solve(Long.parseLong(splits[0]), Long.parseLong(splits[1]));
			System.out.println(result);
		}
	}

	private static long solve(long a, long b) {
		
		long curSum = 0;
		long curNum = a; 
		long[] num = new long[20];
		int pos = num.length-1;
		while(curNum > 0) {
			long d = curNum%10;
			curSum+=d;
			curNum/=10;
			num[pos--] = d;
		}
		
		int k = num.length-1;
		while(curSum > b) {
			curSum = curSum - num[k];
			num[k] = 0;
			num[k-1]++;
			k = k-1;
			
			while(num[k] > 9) {
				num[k] = 0;
				num[k-1]++;
				k = k-1;
				curSum = curSum - 9; 
			}
			
			curSum++;
		}

		StringBuilder res = new StringBuilder();
		int i = 0;
		while(num[i] == 0)
			i++;
		
		for(int j = i; j < num.length; j++) {
			res = res.append(num[j]);
		}
		
		return Long.parseLong(res.toString()) -a;
		
	}

}