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.*;
public class Favorite {
    static int T, x;
    public static void main (String[] args) {
        Scanner scan = new Scanner (System.in);
        T = scan.nextInt();
        for (int l = 0; l < T; l++) {
            x = scan.nextInt(); char c = '8'; String s = "9";
            if (x > 45) System.out.println(-1);
            else if (x < 10) System.out.println(x);
            else {
                while (x > sum(s) + Character.getNumericValue(c)) {
                    s = Character.toString(c) + s; c--;
                }
                if (x > sum(s)) s = Integer.toString(x - sum(s)) + s;
                System.out.println(s);
            }
        }
    }
    public static int sum (String s) {
        int sum = 0;
        for (int i = 0; i < s.length(); i++) sum += Character.getNumericValue(s.charAt(i));
        return sum;
    }
}