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:
for _ in range(int(input())):
    x = int(input())

    if x > 45:
        print(-1)
        continue

    if x <= 9:
        print(x)
        continue

    for i in range(1 , 10):
        if ((i/2)*(19 - i)) >= x:
            term = i

            extra = ((i/2)*(19 - i)) - x
            break
    curr = 9
    output = ""
    for i in range(term - 1):
        output = str(curr - i) + output
    output = str(int(curr - term + 1 - extra)) + output

    print(output)