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>
# define sz(x) (int)((x).size())
# define f first 
# define s second
# define pb push_back 
# define all(x) x.begin(), x.end() 

using namespace std;

using ll = long long;  
using pii = pair<int, int>;

const int mod = 1e9 + 7, N = 1e6 + 5;

void solve() {
    int x;
    cin >> x;
    int ans = 1e9;
    for (int mask = 0; mask < (1 << 9); ++mask) {
        int sum = 0;
        vector<int>v;
        for (int j = 0; j < 9; ++j) {
            if (mask >> j & 1) {
                sum += j + 1;
                v.pb(j+1);
            }
        }
        if (sum == x) {
            sort(all(v));
            reverse(all(v));
            int res = 0, cur = 1;
            for (int j = 0; j < sz(v); ++j){
                res += v[j] * cur;
                cur *= 10;
            }
            ans = min(ans, res);
        }
    }
    cout << (ans == 1e9 ? -1 : ans) << '\n';
}
 
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	int t = 1;
	cin >> t;
	while (t--) solve();
}