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.*;
import java.util.*;

public class Main {
    public static void main(String[] args) throws IOException{
        BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
        int q = pint(in);
        		
        for(; q > 0; q--) {
        	StringTokenizer st = new StringTokenizer(in.readLine());
        	long n = Long.parseLong(st.nextToken()), s = pint(st);
        	long p = n;
        	long t = 0;
        	while(p > 0) {
        		t += p % 10;
        		p /= 10;
        	}
        	long step = 0;
        	long a = 1;
        	while(t > s) {
        		step += a * (10 - (n % 10));
        		a *= 10;
        		t -= n % 10;
        		n /= 10;
        		while(n % 10 == 9) {t -= 9; n /= 10; a *= 10;}
        		n++;
        		t++;
        	}
        	System.out.println(step);
        }
    }
    static int pint(StringTokenizer st) {return Integer.parseInt(st.nextToken());}
    static int pint(BufferedReader in) throws IOException{return Integer.parseInt(in.readLine());}
}