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 PYTHON):

Solution:
enter = int(input())

def find_unique(n):
    sum = 0
    used = []
    actual = 9
    while sum < n:
        if((sum+actual) <= n):
            sum += actual
            used.append(actual)
        actual -= 1
        if(actual == 0):
            break
    if(sum == n):
        output = ""
        for a in range(len(used)-1, -1, -1):
            output += str(used[a])
        print(output)
    else:
        print("-1")
            

for i in range(enter):
    number = int(input())
    find_unique(number)