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 C_ {
    private static final BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    private static final PrintWriter pw = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
    private static StringTokenizer st;

    private static int readInt() throws IOException {
        while (st == null || !st.hasMoreTokens()) st = new StringTokenizer(br.readLine());
        return Integer.parseInt(st.nextToken());
    }

    public static void main(String[] args) throws IOException {
        int T = readInt();
        while (T-- > 0) {
            int x = readInt();
            if (x > 45) {
                pw.println(-1);
            } else {
                int ans = 0;
                int largestPossibleDigit = 9;
                int powerOf10 = 1;
                assert x >= 1;
                do {
                    int digit = Math.min(x, largestPossibleDigit);
                    ans += digit * powerOf10;
                    largestPossibleDigit--;
                    x -= digit;
                    powerOf10 *= 10;
                } while (x > 0);
                pw.println(ans);
            }
        }

        pw.close();
    }
}