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 UniqueNumber {


    public static void main(String[] args) {

        Scanner scan = new Scanner(System.in);

        int t = scan.nextInt();

        while (t-- != 0) {

            int x = scan.nextInt();
            if (x % 10 == x) {
                System.out.println(x);
                continue;
            }
            if (x > 45) {
                System.out.println(-1);
                continue;
            }
            StringBuilder answer = new StringBuilder();
            int[] numbers = new int[9];
            for (int i = 0; i < numbers.length; i++)
                numbers[i] = i + 1;
            int idx = numbers.length - 1;
            while (idx >= 0) {
                if (x - numbers[idx] < 0) {
                    idx--;
                    continue;
                }
                x -= numbers[idx];
                answer.append(numbers[idx]);
                idx--;
            }

            System.out.println(answer.reverse());


        }
    }


}