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.Scanner;
public class code1462C {

	public static void main(String[] args) {
		Scanner sc=new Scanner(System.in);
		int t=sc.nextInt();
		for(int j=1;j<=t;j++)
		{ int x=sc.nextInt();
		int i=9,count=1,num=0;
		 if(x>=1 && x<=9)
			  System.out.println(x);
		  else if(x>=10 && x<=45)
		  { 
		   do
		   { x=x-i;
		   if(x<0)
			   x=x+i;
		   else
			{num=num+i*count;
		    count*=10;
		   }
		    i--;
		   }
		   while(x!=0);
		 
			System.out.println(num);
		  }
		  else
			  System.out.println("-1");
	}
	}
}