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.lang.*;
import java.util.*;
public class UniqueNumber {
public static void main(String[] args) {
	Scanner s=new Scanner(System.in);
	int t=s.nextInt();
	while(t-->0) {
		int x=s.nextInt();
		int sum=0,last=9;
		ArrayList<Integer> a=new ArrayList<>();
		while(sum<x&&last>0) {
			a.add(Math.min(x-sum,last));
			sum+=last;
			last--;
		}
		if(sum<x)
			System.out.println("-1");
		else
		{
			Collections.sort(a);
			for(int i:a)
				System.out.print(i);
			System.out.println();
		}
	}
}
}