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.*;
import java.lang.*;

public class main{
    public static void main(String[] args){
        Scanner sc=new Scanner(System.in);
        int t=sc.nextInt();
        
        for(int p=0;p<t;p++){
            int x=sc.nextInt();
            if(x>45){
                System.out.println("-1");
                continue;
            }
            if(x<=9){
                System.out.println(x);
                continue;
            }
            int temp=x,i=9;
            while(temp>i){
                temp-=i;
                i--;
            }
            System.out.print(temp);
            i++;
            while(i!=10){
                System.out.print(i++);
            }
            System.out.println();
        }
    }
}