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 Main {
    public static void main(String[] args) {
        Scanner input = new Scanner (System.in);
        int t = input.nextInt();
        for (int i = 0; i < t; i++) {
            int n = input.nextInt();
            if ( n<=9){
                System.out.println(n);
            }
            else if (n>=46){
                System.out.println("-1");
            }
            else{
                String s ="";
                for (int j = 9; j >=1 ; j--) {
                    if (n<=9 && n<=j){
                       s=n+s;
                       n=0;
                       break;
                    }
                    else{
                        s=j+s;
                        n-=j;
                    }
                }
                System.out.println(s);
            }
        }
    }

}