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

public class c
{
    public static void main(String[] args)
    {
    	FastScanner sc = new FastScanner();
    	int T = sc.nextInt();
    	while (T-- > 0)
    	{
    		int num = sc.nextInt();
            StringBuilder res = new StringBuilder();
            int choice = 9;
            while (num > 0 && choice > 0)
            {
                if (num >= choice)
                {
                    num-=choice;
                    res.append(choice);
                }
                choice--;
            }
            if (num != 0)
            {
                System.out.println("-1");
            }
            else
            {
                System.out.println(res.reverse());
            }
    	}
    }

    static class FastScanner
    {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st = new StringTokenizer("");
        String next()
        {
            while (!st.hasMoreTokens())
            {
                try
                {
                    st = new StringTokenizer(br.readLine());
                }
                catch (IOException e)
                {
                        e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        int nextInt()
        {
            return Integer.parseInt(next());
        }

        int[] readArray(int size)
        {
            int[] arr = new int[size];
            for (int i = 0; i < size; i++)
            {
                arr[i] = nextInt();
            }
            return arr;
        }

        long nextLong()
        {
            return Long.parseLong(next());
        }
    }
}