Problem: You are given a positive number x. Find the smallest positive integer number that has the sum of digits equal to x and all digits are distinct (unique).

Input

The first line contains a single positive integer t (1 ≤ t ≤ 50) — the number of test cases in the test. Then t test cases follow.

Each test case consists of a single integer number x (1 ≤ x ≤ 50).

Output

Output t answers to the test cases:

  * if a positive integer number with the sum of digits equal to x and all digits are different exists, print the smallest such number; 
  * otherwise print -1. 

Example

Input


4
1
5
15
50


Output


1
5
69
-1

Solution (in JAVA):

Solution:
import java.util.Scanner;
import java.util.*;
public class sol{
    public static void main(String args[]){        
        Scanner sc=new Scanner(System.in);
       int t=sc.nextInt();
       while(t>0){

           int x=sc.nextInt();
        //    int ar[10]={0,1,1,1,1,1,1,1,1,1};
           String ans="";
        //    boolean flag=true;
           int counter=9;
           while(counter>0 && x>0){
            //    System.out.println("before");
            //    System.out.println(counter);
            //    System.out.println(x);
               if(x>=counter){
                    //   System.out.println("inside if"); 
                   x-=counter;
                   ans+=counter;
               }
               counter--;
                //   System.out.println("after");
           
                //   System.out.println(counter);
            //    System.out.println(x);

           }
           if(x==0){
               System.out.println(new StringBuilder(ans).reverse());
           }
           else{
               System.out.println("-1");
           }
           t--;

       }
    }
}