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())
a = [1, 2, 3, 4, 5, 6, 7, 8, 9]
for _ in range(t):
    x = int(input())
    ans = 1234567890
    for i in range(2 ** 9):
        answer = []
        sm = 0
        for j in range(9):
            if i & (1 << j):
                answer.append(str(a[j]))
                sm += a[j]
        if sm == x:
            ans = min(int(''.join(answer)), ans)
    if ans == 1234567890:
        print(-1)
    else:
        print(ans)