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 JAVA):

Solution:
//load('js/C. Unique Number.js');

T=+readline();
while(T--){
   var n=readline();
   var sum_of_digit='';
   if(n<=9){
    print(n);
   }
   else if(n>45)
    print(-1);
   else{
     sum_of_digit='9';
     n-=9;
    for(var i=8;i>=1;i--){
     // print(n);
     if(n<=i){
        sum_of_digit+=String(n);
        break;
     }
      else if(n>=i){
            sum_of_digit+=String(i);
           // print(String(i));
            n-=i;
        }
    }
    var ans ='';
    //print(sum_of_digit);
      for(i=sum_of_digit.length-1;i>=0;i--){
         // print(sum_of_digit[i]);
         ans+=sum_of_digit[i];
      }
      print(ans);
   }
}