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;
 
typedef long long ll;

#define fr first
#define sc second
#define pb push_back

ll t, x, num;
string ans;

int main(){
    
   cin>>t;
   
   while(t--){
       
       cin>>x;
       
       num = 9;
       ans = "";
       
       if(x <= 45){
           
           while(x > num){
           
           //cout<<ans<<endl;
           ans += to_string(num);
           x -= num;
           num--;
           
           }
           
           ans += to_string(x);
           
           reverse(ans.begin(),ans.end());
           
           cout<<ans<<endl;
       }
       else
       cout<<"-1"<<endl;
       
       
       
   }
   
   return 0;
}