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;
        if(x > 45)
        cout << -1 << "\n";
        else
        { 
          vector<bool> v(10,true);
          v[0] = false;
          vector<int> v1;
          int i = 9;
          while(x != 0)
          {
              if(x > i)
              {
                 v1.push_back(i);
                 x -= i;
                 i--;
              }
              else
              {
                  v1.push_back(x);
                  x = 0;
              }
          }
          for(int i =v1.size()-1;i>=0;i--)
          {
              cout << v1[i];
          }
          cout << "\n";
        }
    }
}