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 Solution{
	static int inf = (int)1e9;
	static boolean taken[];
	static Scanner sc = new Scanner(System.in);
	static int minsum(int cursum,int finalsum,int curnum,int ptr){
		if(finalsum==cursum)
			return curnum;
		if(ptr==10)
			return inf;
		int val1,val2;
		val1 = minsum(cursum+ptr,finalsum,curnum*10+ptr,ptr+1);
		val2 = minsum(cursum,finalsum,curnum,ptr+1);
		val1 = val1>val2?val2:val1;
		return val1;
	}
	/*
	 *
	 * */
	public static void main(String args[]){
		int t = sc.nextInt();
		while(t-->0){
			int x = sc.nextInt();
			taken = new boolean[10];
			int ans = minsum(0,x,0,0);
			ans = ans==inf?-1:ans;
			System.out.println(ans);
		}
	}
}