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:
def solve(n):
    if(n>45):
        return -1
    if(n<10):
        return n
    s=0
    ls=[]
    dig=9
    while(dig>0 and s<n):
        if(n-s<dig):
            ls.append(str(n-s))
            s=n
        else:
            ls.append(str(dig))
            s+=dig
            dig-=1
    ls.reverse()
    return ''.join(ls)
            
t=int(input())
while(t):
    n=int(input())
    print(solve(n))
    t-=1