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 Main {
    public static long sum(long x)
    {
        long sum=0;
        while(x>0)
        {
            sum+=(x%10);
            x=x/10;
        }
        return sum;
    }
    public static void main(String args[]) {
        Scanner s=new Scanner(System.in);
        int t=s.nextInt();
        while(t!=0)
        {
            long n=s.nextLong();
            int sum=s.nextInt();
            long x=n;
            int sum1=0;
            while(x>0)
            {
                sum1+=(x%10);
                x=x/10;
            }
            if(sum1<=sum)
            {
                System.out.println(0);
            }
            else
            {
                long min=0,p=1;
                long fg=n,sumx=0;
                while(fg>0 && sum(n+min)>sum)
                {
                    long ldigit = (fg%10);
                    if(ldigit!=0)
                    {
                        fg=fg/10;
                        min+=(p*(10-ldigit));
                        p=p*10;
                        fg++;
                    }
                    else
                    {
                        p=p*10;
                        fg=fg/10;
                    }
                    if(fg==1)
                    {
                        fg=0;
                        break;
                    }
                    
                }
                System.out.println(min);
            }
            
            t--;
        }
    }
}