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(){
    int t;
    cin>>t;
    while(t--){
        int x;
        cin>>x;
        int sum=0, last=9;
        vector<int>v;
        while(sum<x && last>0){
            v.push_back(min(x-sum,last));
            sum+=last;
            last--;
        }
        if(sum<x){
            cout<<"-1";
        }
        else{
            reverse(v.begin(),v.end());
            for(auto x: v){
                cout<<x;
            }
        }
        cout<<endl;
    }



    return 0;
}