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 n;
        cin>>n;
        if(n>45)
        {
            cout<<"-1"<<endl;
            continue;
        }

        string temp;
        int j=9;
        while(n>0)
        {
            if(n>j)
            {
                temp+=to_string(j);
                n-=j;
                j--;
            }
            else
            {
                temp+=to_string(n);
                n=0;
                break;
            }
        }
        reverse(temp.begin(), temp.end());
        cout<<temp<<endl;
    }
}