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

Solution:
t=int(input())
while t:
     t-=1
     cc=0
     ssum=ans=0
     k=1
     x=int(input())
     if x>45:
          print("-1")
     else:
          for i in range(9,-1,-1):
               for j in range(i,-1,-1):
                    if(ssum+j == x):
                         ans+=j*k
                         cc=1
                         break
               ssum+=i
               if cc==1:
                    break
               ans+=i*k
               k*=10
          print("%d"%ans)