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.*;
public class CF
{
    public static int sumD(String sn)
    {
        long n=Long.parseLong(sn);
        int d=0;
        while(n>0)
        {
            d+=n%10;
            n=n/10;
        }
        return d;
    }
    public static void main(String args[])
    {
        Scanner sc=new Scanner(System.in);

        int t=sc.nextInt();
        
        for(int a0=0;a0<t;a0++)
        {
            String s=sc.next();
            int asum=sumD(s);
            int st=sc.nextInt();
            int sum=0;
            long res=0;
            int i=0;
            if(asum>st)
            for(i=0;i<s.length();i++)
            {
                sum=sum+Integer.parseInt(s.substring(i,i+1));
                if(sum+1>st)
                {
                    if(i==0)
                    res=(long)Math.pow(10,s.length())-Long.parseLong(s);
                    else
                    {
                        res=(long)Math.pow(10,s.length()-i)-Long.parseLong(s.substring(i));
                    }
                    break;
                }
            }
            
            System.out.println(res);
        }

    }
}