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 <iostream>
#include <vector>
using namespace std;

int main()
{
   int t;
   cin>>t;
   while(t--)
   {
       vector<int> v;
       int i,x,y=9;
       cin>>x;
       while(x>y&&y>0)
       {
           v.push_back(y);
           x=x-y;
           y--;
       }
      if(x<=y)
      {
          v.push_back(x);
          for(i=v.size()-1;i>=0;i--)
          {
              cout<<v[i];
          }
          cout<<"\n";
      }
      else
      {
          cout<<"-1"<<"\n";
      }
   }
   
   return 0;
}