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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;
public class Prc
{
	public static void main(String[]args) throws IOException
	{
		int t,n,i,j;
		Scanner in=new Scanner(System.in);
		t=in.nextInt();
	//	BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
		//String s;
		int ar[];
		while(t-->0)
		{
		     n=in.nextInt();
		     i=1;
		     int sum=0,p=1;
		     boolean f=false;
		     if(n>45)
		     {
		          System.out.println("-1");
		          continue;
		     }
		     if(n/10==0)
		     {
		          System.out.println(n);
		          continue;
		     }
		     int num=9;
		     while(n>0)
		     {
		          if(n>num)
		          {
		          sum=sum+p*num;
		          n=n-num;
		          }
		          else
		          {
		          sum=sum+p*n;
		          n=n-n;
		          }
		          p=p*10;
		          num--;
		     }
		     
		     
		     System.out.println(sum);
		     
		}
	}
}