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.IOException;
import java.io.InputStreamReader;
import java.lang.reflect.Array;
import java.util.ArrayList;
import java.util.Collections;
import java.util.StringTokenizer;

public class Main {

    public static void main(String[] args) {
        FastReader reader = new FastReader();
        int t = reader.nextInt();
        while (t-- > 0) {
            ArrayList<Integer> list = new ArrayList<>();
            int n = reader.nextInt();
            int temp = n;
            if (n > 45){
                System.out.println(-1);
            }
            else {
                int count = 1;
                for (int i = 9; i > 0; i--) {
                    if (n - i <= 0) {
                        break;
                    } else {
                        count++;
                        n -= i;
                    }
                }
                for (int i = 9; i > 0; i--) {
                    if (temp <= i) {
                        list.add(temp);
                        count--;
                        if (count == 0)
                            break;
                    } else {
                        list.add(i);
                        temp -= i;
                        count--;
                        if (count == 0)
                            break;
                    }
                }
                for (int i = list.size() - 1; i >= 0; i--) {
                    System.out.print(list.get(i));
                }
                System.out.println();
            }
        }
    }
}

class FastReader {
    BufferedReader br;
    StringTokenizer st;

    public FastReader() {
        br = new BufferedReader(new
                InputStreamReader(System.in));
    }

    String next() {
        while (st == null || !st.hasMoreElements()) {
            try {
                st = new StringTokenizer(br.readLine());
            } catch (IOException e) {
                e.printStackTrace();
            }
        }
        return st.nextToken();
    }

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

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

    double nextDouble() {
        return Double.parseDouble(next());
    }

    String nextLine() {
        String str = "";
        try {
            str = br.readLine();
        } catch (IOException e) {
            e.printStackTrace();
        }
        return str;
    }
}