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

public class round667D {
    public static void main(String s[]) throws Exception {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        int t = Integer.parseInt(br.readLine());
        while(t-->0){
            s=(br.readLine()).split(" ");
            long n=Long.parseLong(s[0]);
            int sum=Integer.parseInt(s[1]);
            int currSum=sum(n);
            BigInteger t1=BigInteger.ONE;
            BigInteger res=BigInteger.ZERO;
            while(currSum>sum && n>0){
                int currDig=(int)(n%10);
                n=n/10;
                if(currDig>0){
                    n=n+1;
                    currDig=10-currDig;
                    res=res.add(t1.multiply(BigInteger.valueOf(currDig)));
                    currSum=sum(n);
                }
                t1=t1.multiply(BigInteger.valueOf(10));
            }
            System.out.println(res);
        }
    }
    static int sum(long a){
        int sum=0;
        while(a>0){
            sum+=a%10;
            a=a/10;
        }
        return sum;
    }
}