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
using namespace std;
int main()
{
    int t{};
    cin >> t;
    while (t--)
    {
        int x;
        cin >> x;
        if (x > 45)
        {
            printf("-1\n");
        }
        else
        {
            vector<int> ans;
            int i = 9;
            while (i && x)
            {
                if (x >= i)
                {
                    x -= i;
                    ans.push_back(i);
                    i--;
                }
                else
                {
                    ans.push_back(x);
                    x -= x;
                }
            }
            reverse(ans.begin(), ans.end());
            for (int i = 0; i < ans.size(); i++)
                printf("%d", ans[i]);
            printf("\n");
        }
    }
}