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() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
	int t;
	cin>>t;
	while(t--) {
	    int n;
	    cin>>n;
	    if(n > 45) {
	        cout<<"-1\n";
	    }
	    else {
            string s = "";
            for(int i = 9 ; i>=1 ; --i) {
                if(n <= 9 && n<=i) {
                    s+= to_string(n);
                    n =0;
                    break;
                }
                else {
                    s += to_string(i);
                    n -=i;
                }
            }
            reverse(s.begin() , s.end());
            cout<<s<<"\n";
	    }
	}
	return 0;
}