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 Main{
    public static void main(String [] args){
        Scanner sc=new Scanner(System.in);
        int t=sc.nextInt();
        while(t-->0)
        {
            int x=sc.nextInt();
            if(x<10)
            {
                System.out.println(x);
            }
            else{
                int j=9;
                int n=0;
                while(x>j && j>0)
                {
                    x=x-j;
                    n=(n*10)+j;
                    j--;
                }
                if(x>j)
                {
                    System.out.println(-1);
                }
                else
                {
                    if(x<=j && x!=0)
                        n=n*10+x;
                    int num=0;
                    while(n>0)
                    {
                        int r=n%10;
                        num=num*10+r;
                        n=n/10;
                    }
                    System.out.println(num);
                }
            }
        }
    }
}