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.ArrayList;
import java.util.Collections;
import java.util.HashMap;
import java.util.Scanner;

public class C {

	static int mod = (int) 1e9 + 7;

	static int ar[];
	static Scanner sc = new Scanner(System.in);
	static StringBuilder out = new StringBuilder();

	static ArrayList<Integer> gr[];
	int n;

	static class pair implements Comparable<pair> {

		int f;
		int s;

		public pair(int a, int b) {
			f = a;
			s = b;
		}

		@Override
		public int compareTo(pair o) {
			// TODO Auto-generated method stub
			if (this.s == o.s)
				return o.f - this.f;
			return this.s - o.s;
		}

	}

	public static void main(String[] args) {
		// rite code start here
		Scanner sc = new Scanner(System.in);
		int tc = sc.nextInt();
		int t = 0;
		while (tc-- > 0) {

			long n = sc.nextLong();
			long n1=n;
			long s = sc.nextLong();
			ArrayList<Long> al = new ArrayList<>();
			long sum = 0;
			while (n != 0) {

				al.add(n % 10);
				n /= 10;
				sum += al.get(al.size() - 1);

			}

			if(sum<=s){
				out.append(0+"\n");continue;
			}
			int i = 0;
			while (i < al.size()) {

				if (sum < s)
					break;

				sum -= al.get(i);

				al.set(i, 0L);
				i++;
			}


		

				while (i < al.size() && al.get(i) == 9) {
					al.set(i, 0L);
					i++;
				}

				if (i == al.size()) {
					al.add(1L);
				}
				
				else{
					al.set(i, al.get(i)+1);
				}

			
			
			Collections.reverse(al);
			n=al.get(0);
			for( i=1;i<al.size();i++){
				n=n*10+al.get(i);
			}
			
			out.append(n-n1+"\n");
			

		}
		System.out.println(out);

	}

}