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 Main {
    public static void main(String[] args) {
        Scanner s=new Scanner(System.in);
        int cases = s.nextInt();
        while (cases>0){
            cases--;
            int a=s.nextInt();
            if (a>45){
                System.out.println(-1);
            } else {
                if (a<10){
                    System.out.println(a);
                } else{
                    int dec=9;
                    StringBuilder ans=new StringBuilder();
                    while (a-dec>0){
                        ans.append(dec);
                        a-=dec;
                        dec--;
                    }
                    ans.append(a);
                    ans.reverse();
                    System.out.println(ans);
                }
            }
        }
    }
}