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:
resList = []
testCount = int(input())
for test in range(testCount):
    num = int(input())
    sum = 0
    numStr=""
    if(num>45):
        resList.append(str(-1))
    elif(len(str(num)) == 1):
        resList.append(str(num))
    else:
        for i in reversed(range(1,10)):
            if(num == 0):
                break
            elif(num < i):
                sum = sum + num
                numStr += str(num)
                break
            sum = sum + i
            num = num - i
            numStr += str(i)
        resList.append(numStr[::-1])
for res in resList:
    print(res)