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.*;
public class codeforces_check {

	public static void main(String[] args)throws IOException {
		InputStreamReader read = new InputStreamReader(System.in);
		BufferedReader inp = new BufferedReader(read);
		int i, t, a, b;
		String[] c = new String[2];
		t = Integer.parseInt(inp.readLine());
		Integer[] d = new Integer[t + 1];
		for(i = 1 ; i <= t; ++i) {
			c = inp.readLine().split(" ");
			a = Integer.parseInt(c[0]);
			b = Integer.parseInt(c[1]);
			int mod = Math.floorMod(a, b);
			if(mod == 0)
				d[i] = 0;
			else
				d[i] = b - mod;
		}
		for(int j = 1; j <= d.length - 1; ++j) {
			System.out.println(+d[j]);
		}
	}
}