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.StringTokenizer;

public class Main {
	
	public static long dsum(long a) {
		long sum =0;
		while(a>0) {
			sum +=a%10;
			a /=10;
		}
		return sum;
	}
	
	public static long pow(int d) {
		long a=1;
		for (int i = 0; i < d; i++) {
			a*=10;
		}
		return a;
	}
	
	public static void main(String[] args) throws NumberFormatException, IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		StringBuilder sb = new StringBuilder();
		StringTokenizer st;
		
		int T = Integer.parseInt(br.readLine());
		
		for (int test_case = 0; test_case < T; test_case++) {
			st = new StringTokenizer(br.readLine());
			long n = Long.parseLong(st.nextToken());
			long s = Long.parseLong(st.nextToken());
			long sum = dsum(n);
			
			
			long ans = 0;
			long now = n;
			long next = n;
			
			if(sum<=s) {
			}
			else {
				int digit = 1;
				while(true) {
					now = next;
					next = (n/pow(digit))*pow(digit)==0?pow(digit):(n/pow(digit))*pow(digit)+pow(digit);
//					System.out.println("next:"+next);
//					System.out.println("dsum:"+dsum(next));
					if(now>next) {
						digit++;
						continue;
					}
					if(dsum(next)<=s) {
						ans = next-n;
						break;
					}
					digit++;
				}
			}
//			System.out.println("ans:"+ans);
			sb.append(ans);
			sb.append("\n");
		}
		System.out.println(sb.toString());
	}
}