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 test{
    public static void main(String[] args){
        Scanner s = new Scanner(System.in);
        int cases = s.nextInt();



        for(int e=0; e<cases; e++) {
            String amount = "";
            int next = s.nextInt();
            if (next <= 45) {
                int[] arr = {9,8,7,6,5,4,3,2,1};
                for (int i = 0; i < arr.length; i++) {
                    for (int j = 0; j <= 8; j++) {
                        if (next >= arr[j]) {
                            next -= arr[j];
                            amount = arr[j] + amount;
                        }
                    }
                }
                System.out.println(amount);
            } else {
                System.out.println("-1");
            }
        }

    }
}