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())

li = [1, 2, 3, 4, 5, 6, 7, 8, 9]

li_check = [0] * 9
result = []
for i in range(1, 2 ** 9 + 1):
    stack = []
    for j in range(9):
        if i & (1 << j):
            stack.append(j+1)
    t = stack[:]
    result.append(t)

for TC in range(1, T + 1):
    n = int(input())
    sol = []
    for i in range(len(result)):
        if sum(result[i]) == n:
            total = 0
            for k in range(len(result[i])):
                total += result[i][k] * (10**(len(result[i])-k-1))
            sol.append(total)
    if sol:
        print(min(sol))
    else:
        print(-1)