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.io.*;
import java.util.*;

public class Codeforces
{
    public static void main(String args[])throws Exception
    {
        BufferedReader bu=new BufferedReader(new InputStreamReader(System.in));
        StringBuilder sb=new StringBuilder();
        int t=Integer.parseInt(bu.readLine());
        while(t-->0)
        {
            int n=Integer.parseInt(bu.readLine());
            int i,j,x=9,max=(1<<x);
            ArrayList<Long> al=new ArrayList<>();
            for(i=1;i<max;i++)
            {
                int cur=0;
                for(j=0;j<x;j++)
                if(((i>>j)&1)==1) cur+=(j+1);

                if(cur==n)
                {
                    long num=0;
                    for(j=0;j<9;j++)
                    if(((i>>j)&1)==1) num=10*num+(j+1);
                    al.add(num);
                }
            }
            if(al.size()==0) sb.append("-1\n");
            else
            {
                Collections.sort(al);
                sb.append(al.get(0)+"\n");
            }
        }
        System.out.print(sb);
    }
}