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;
void solve(){
    int n,x;
    cin>>n;
    if(n>=1 && n<=9)
        cout<<n;
    else if(n>=10 && n<=17)
        cout<<n-9<<9;
    else if(n>=18 && n<=24)
        cout<<n-17<<89;
    else if(n>=25 && n<=30)
        cout<<n-24<<789;
    else if(n>=31 && n<=35)
        cout<<n-30<<6789;
    else if(n>=36 && n<=39)
        cout<<n-35<<56789;
    else if(n>=40 && n<=42)
        cout<<n-39<<456789;
    else if(n==43 || n==44)
        cout<<n-42<<3456789;
    else if(n==45)
        cout<<123456789;
    else
        cout<<-1;
    cout<<endl;
}
int main(){
    int t;
    cin>>t;
    while(t--){
        solve();
    }
}