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.*;

public class UniqueElemnts {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
      Scanner sc = new Scanner(System.in);
     
      int t=sc.nextInt();
      while(t-->0){
          int x=sc.nextInt();
          if(x>45)
              System.out.println("-1");
          else if(x<=9)
              System.out.println(x);
          else{
              String ans="";
              int i=9;
              while(x!=0){
                  if(x>=i){
                      ans+=i;
                      x-=i;
                  }
                  i--;
              }
              for(int j=ans.length()-1;j>=0;j--){
                  System.out.print(ans.charAt(j));
              }
              System.out.println();
          }
      }
    	  
    	 
      
	}

}