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())
lst = [1, 2, 3, 4, 5, 6, 7, 8, 9]
lst1 = list(reversed(lst))
for _ in range(T):
    n = int(input())
    ans = []
    if n > 45:
        print(-1)
        continue
    elif n < 10:
        print(n)
        continue
    else:
        for i in lst1:
            n -= i
            ans.append(i)
            # print(ans)
            if n in lst1 and n not in ans:
                print(n, end="")
                ans.reverse()
                for j in ans:
                    print(j, end="")
                break
        print()