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

	    for(int tt = 0; tt<T; tt++){
	    	// here write some code
	    	int x = in.nextInt();

	    	if(x<10){
	    		System.out.println(x);
	    	}else if(x>45){
	    		System.out.println(-1);
	    	}else{
	    		String res = "";
	    		while(x!=0){
	    			for(int i = 9; i>0; i--){
	    				if(x>i){
	    					res = addChar(res, (char)(i+'0'));
	    					x-=i;
	    				}else{
	    					res = addChar(res, (char)(x+'0'));
	    					x = 0;
	    					break;
	    				}
	    			}
	    		}
	    		System.out.println(Integer.parseInt(res));
	    	}
	    }
	} 
	public static String addChar(String str, char ch) {
	    StringBuilder sb = new StringBuilder(str);
	    sb.insert(0, ch);
	    return sb.toString();
	}
}
//INPUT ARRAY
// int n = in.nextInt();
// int arr[] = new int[n];
// for (int i = 0; i<n; i++) {
//    arr[i] = in.nextInt();
// }