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 ll long long
#define IO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
double PI=acos(-1);
 
void test_case()
{
    int n;cin>>n;
    string ans="";
    char a='9';
    if(n>45)
    {
        cout<<-1<<'\n';
        return;
    }
    while(n>0)
    {
        if(a-'0'<=n)
        {
            ans+=a;
            n-=(a-'0');
        }
        a--;
    }
    reverse(ans.begin(),ans.end());
    cout<<ans<<'\n';
 
 
}
 
int main(){
    IO
    int t;cin>>t;
    while(t--)
    {
        test_case();
    }
 
    return 0;
}