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.*;
import java.math.*;
public class Solution {
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int t = Integer.parseInt(in.next());
		for(int tt = 0; tt < t; tt++) {
			long n = Long.parseLong(in.next());
			long nn = n;
			int make = Integer.parseInt(in.next());
			while(sum(nn) > make) {
				String strnn = nn + "";
				int p = 0;
				for(int i = strnn.length() - 1; i >= 0; i--) {
					int cur = Integer.parseInt(strnn.substring(i, i + 1));
					if(cur > 0) {
						nn += (long) Math.pow(10, p) * (10 - cur);
						break;
					}
					p += 1;
				}
			}
			System.out.println(Math.abs(n - nn));
		}
	}
	public static int sum(long n) {
		int sumsum = 0;
		String nn = n + "";
		for(int i = 0; i < nn.length(); i++) {
			sumsum += Integer.parseInt(nn.substring(i, i + 1));
		}
		return sumsum;
	}
}