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;
public class Main {

    public static void main(String[] args)
    {
        Scanner input = new Scanner(System.in);
        long t = input.nextInt();
        while(t-->0)
        {
            int x= input.nextInt();
            if(x>45)
                System.out.println(-1);
            else
            {
                StringBuilder s=new StringBuilder();
                for(int i=9;i>=1;i--)
                {
                    if(x>=i)
                    {
                        x-=i;
                        s.append(i);
                    }
                    else
                    {
                        s.append(x);
                        break;
                    }
                }
                s.reverse();
                System.out.println(Integer.parseInt(s.toString()));
            }
        }
    }
}