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.io.*;
import java.util.*; 
import java.lang.*;
public class Main{	
	public static void main(String[] args)throws IOException{
		BufferedReader br= new BufferedReader(new InputStreamReader(System.in));
		PrintWriter pw = new PrintWriter(System.out);
		int t = Integer.parseInt(br.readLine());
		while(t-->0){
			int n = Integer.parseInt(br.readLine());
			String result = "";
			int largestDigit = 9;
			
			while(largestDigit!=0 && n!=0){
				if(n<largestDigit)
					largestDigit = n;
					
				result=largestDigit+result;
				n-=largestDigit;
				largestDigit--;
			}
			if(n==0)
			pw.println(result);
			else
			pw.println(-1);
			
		}
		pw.flush();
	}
	
}