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 f(x):
    s=0
    for i in range(10):
        if x>=sum(range(i,10)):
            s = sum(range(i,10))
            break
    if x == s:
        return "".join(map(str,range(i,10)))
    return "".join(map(str, sorted([x-s]+list(range(i,10)))))
t = int(input())
for _ in range(t):
    x = int(input())
    if x>45:
        print(-1)
    elif x==45:
        print(123456789)
    elif x<10:
        print(x)
    else:
        print(f(x))