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 MyClass {
    public static void main(String args[]) {
      int i,j,t,n;
      String s,d1,d2,d3,d4,d5;
      Scanner sc=new Scanner(System.in);
      t=sc.nextInt();
      while(t!=0)
      {
          n=sc.nextInt();
          String ss="";
          s=Integer.toString(n);
          if(s.length()==1)
          System.out.println(n);
          else if(n>45)
          System.out.println("-1");
          else
          {
              i=9;
              int p=n;
              while(p>i)
              {
                  ss=Integer.toString(i)+ss;
                  p=p-i;
                  i--;
              }
              if(p!=0)
              ss=Integer.toString(p)+ss;
              System.out.println(ss);
          }
          t--;
      }
    }
}