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 x;
		cin>>x;
		if(x<10)
		{
		cout<<x<<endl;
		continue;
		}
		if(x>45)
		{
		cout<<"-1"<<endl;
		continue;
		}
		if(x>=10 && x<18)
		{
		  cout<<x-9<<"9"<<endl;
		}
		else if(x>=18 && x<25)
		{
			cout<<x-17<<"8"<<"9"<<endl;
		}
		else if(x>=25 && x<31)
		{
			cout<<x-24<<"7"<<"8"<<"9"<<endl;
		}
		else if(x>=31 && x<36)
		{
			cout<<x-30<<"6"<<"7"<<"8"<<"9"<<endl;
		}
		else if(x>=36 && x<40)
		{
			cout<<x-35<<"5"<<"6"<<"7"<<"8"<<"9"<<endl;
		}
		else if(x>=40 && x<43)
		{
			cout<<x-39<<"4"<<"5"<<"6"<<"7"<<"8"<<"9"<<endl;
		}
		else if(x>=43 && x<45)
		{
				cout<<x-42<<"3"<<"4"<<"5"<<"6"<<"7"<<"8"<<"9"<<endl;
		}
		else 
		{
			cout<<x-44<<"2"<<"3"<<"4"<<"5"<<"6"<<"7"<<"8"<<"9"<<endl;
		}
	}
}