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

/* Name of the class has to be "Main" only if the class is public. */
public class Codeforces {
   static long sumOfDigits(long n)
    {
        long sum=0;
        while(n>0)
        {
            long d=n%10;
            n=n/10;
            sum=sum+d;
        }
        return sum;
    }
    public static void main(String[] args) throws java.lang.Exception {
        /* your code goes here */
        BufferedReader buf = new BufferedReader(new InputStreamReader(System.in));
       int t = Integer.parseInt(buf.readLine());
        StringBuilder sb = new StringBuilder();

        for (int i = 0; i < t; i++) {
            String st1[] = (buf.readLine()).split(" ");
            long n=Long.parseLong(st1[0]);
            char ch[]=(st1[0]).toCharArray();
            int s=Integer.parseInt(st1[1]);
            int arr[]=new int[ch.length];
            for(int j=0;j<ch.length;j++)
                arr[j]=ch[j]-'0';
          //  sb.append(1);
            long sum=0;
            for(int j=0;j<arr.length;j++)
                sum+=arr[j];
            long moves=0;
            if(sum<=s)
                moves=0;
            else
            {
                int ct=0;
                while(ct<=18)
                {
                    long d=(n/((long)Math.pow(10,ct)))%10;
                    long val=((10-d)%10)*(long)Math.pow(10,ct);
                    moves=moves+val;
                    ct++;
                    n=n+val;
                    long no=n;
                    sum=sumOfDigits(no);
                    if(sum<=s)
                        break;
                }
            }
            long diff=s-sum;
            sb.append(moves+"\n");
        }
        System.out.println(sb);
    }
}