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:
// package com.company;

import java.util.Arrays;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Scanner;

public class p3 {

    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        int t = scan.nextInt();
        while(t>0){
            t--;
            int x = scan.nextInt();
            if(x>45){
                System.out.println("-1");
            }
            else{
                StringBuilder str = new StringBuilder();
                int curr = 9;
                while(curr > 0){
                    if(curr <= x){
                        str.append(curr);
                        x-=curr;

                    }
                    curr--;
                }
                char[] temp = str.toString().toCharArray();
                Arrays.sort(temp);
                str = new StringBuilder();
                for(char a : temp){
                    str.append(a);
                }
                System.out.println(str.toString());
            }
        }
    }
}