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 CPP):

Solution:
#include<bits/stdc++.h>
using namespace std;
int main()
{
	int t;
	cin>>t;
	while(t--)
	{
		int n,i,l;
		cin>>n;
		int a[10]={0};
		if(n>45)
		{
			cout<<"-1\n";
		}
		else if(n>9 && n<=45)
		{
			i=0;
			l=0;
			while(n>0)
			{
				if(n>=9-i)
				{
					a[l]=9-i;
					n-=9-i;
					l++;
				}
				i++;
			}
			sort(a,a+l);
			for(i=0;i<l;i++)
			{
				cout<<a[i];
			}
			cout<<endl;
		}
		else if(n<=9)
		{
			cout<<n<<endl;
		}
	}
	return 0;
}