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())
for i in range(t):
    n=int(input())
    if n>45:
        print(-1)
    elif n<=9:
        print(n)
    else:
        digit=9
        l=[]
        while True:
            if n>digit:
                l.append(digit)
                n-=digit
                digit-=1
            else:
                l.append(n)
                break
        l.reverse()   
        x="".join(map(str,l))
        print(x)