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

Solution:
ans={}
def solve(n,s,i):
    if n=='':
        for i in range(1,10):
            solve(str(i),i,i)
        return
    try:
        ans[s]=min(ans[s],int(n))
    except KeyError:
        ans[s]=int(n)
    
    if s>50:
        return
    i+=1
    while i<10:
        solve(n+str(i),s+i,i)
        i+=1
solve('',0,0)
for _ in range(input()):
    n=input()
    try:
        print ans[n]
    except KeyError:
        print -1