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;




void solve(){
	int n;cin>>n;
	
	if(n <= 45){
		int point = 9;
		string ans = "";
		int x = n;

		while(x > point){
			ans += to_string(point);
			x -= point;
			point--;
		}
		if(x) ans += to_string(x);
		reverse(ans.begin(),ans.end());
		cout<<ans<<endl;
		return;
	}

	cout<<"-1"<<endl;
}


int main(){
	ios::sync_with_stdio(false); cin.tie(0);
	#ifndef ONLINE_JUDGE 
	freopen("input.txt", "r", stdin);
	freopen("result.txt", "w", stdout);
	#endif
	int t;cin>>t;
	while(t--)
		solve();

	

	

	return 0;
}//main