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;

#define endl "\n"
#define ll long long
#define PB push_back
#define F first
#define S second
#define all(a) a.begin(), a.end()
#define MAX 1000
#define Fast ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define w(a) cout<<#a<<" : "<<a<<endl;

void solve(int x)
{
    int cifra=9;
    stack<int> ans;
    for(;x>0;)
    {
        cifra=min(cifra,x);
        ans.push(cifra);
        x-=cifra;
        cifra--;
    }
    if(x<0)
    {
        cout<<-1<<endl; return;
    }
    while(!ans.empty())
    {
        cout<<ans.top();
        ans.pop();
    }
    cout<<endl;
}

int main()
{
    Fast;
    int t,x;
    cin>>t;
    while(t--)
    {
        cin>>x;
        solve(x);
    }
    return 0;
}