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:
/* package codechef; // don't place package name! */

import java.util.*;
import java.lang.*;
import java.io.*;

/* Name of the class has to be "Main" only if the class is public. */
public class Codechef
{
    public static int sum(long n){
        int sum = 0;
        while (n != 0){
            sum += (int)(n % 10);
            n = n / 10;
        }
        return sum;
    }
    
    public static long func(long n, int x){
        if (sum(n) <= x) return 0;
        long count = 0;
        long pw = 1;
        for (int i = 0; i < 18; i++){
            int digit = (int)((n/pw) % 10);
            long add = pw * ((10 - digit) % 10);
            n = n + add;
            count = count + add;
            if (sum(n) <= x){
                break;
            }
            pw *= 10;
        }
        return count;
    }
    
	public static void main (String[] args) throws java.lang.Exception
	{
		// your code goes here
		Scanner s = new Scanner(System.in);
		int t = s.nextInt();
		while (t-- != 0){
		    long n = s.nextLong();
		    int x=  s.nextInt();
		    System.out.println(func(n,x));
		}
	}
}