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:
//package CodeForces;

import java.util.Scanner;

public class AmazonNonSDE {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner s=new Scanner(System.in);
		int t=s.nextInt();
		while(t>0)
		{
			int n=s.nextInt();
			String ans="";
			for(int i=9;i>=1;i--)
			{
				if(n>=i)
				{
					ans=i+ans;
					n=n-i;
				}
			}
			
			if(n==0)
			{
				System.out.println(ans);
			}
			else
			{
				System.out.println(-1);
			}
			
			t--;
		}

	}

}