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 lane{
    public static void main(String args[]){
        Scanner sc=new Scanner(System.in);

        int t=sc.nextInt();
        while(t-->0){
            long n=sc.nextLong();
            long s=sc.nextLong();

            long pow=1;

            long sum=0;
            long n1=n;
            while(n1>0){
                long d=n1%10;
                sum+=d;
                n1/=10;
            }


            long ans=0;
            int q=0;
            while (sum>s && n>0){
                long d=n%10;
                long diff=sum-s;
                d+=q;
                //System.out.println(diff+" "+d);
                if(d!=0){
                    q=1;
                    ans+=(pow*(10-d));
                    sum-=((d)-1);
                }else{
                    q=0;
                }

                pow*=10;
                n/=10;

            }
            System.out.println(ans);
        }

    }






}