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:
import itertools
t=int(input())
num=[10**9 for i in range(51)]
num[45]=123456789
for i in range(10):
    num[i]=i
alp=[i for i in range(10)]
for i in range(2,9):
    for j in itertools.combinations(alp,i):
        tot=sum(j)
        x=''
        for v in j:
            x+=str(v)
        x=int(x)
        num[tot]=min(num[tot],x)
for i in range(46,51):
    num[i]=-1
for i in range(t):
    s=int(input())
    ans=num[s]
    print(ans)