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 getCases():
    cases = []
    t = int(input())
    for case in range(t):
        cases.append(int(input()))
    return cases


def solve(num):
    if num > 45:
        return -1

    foo = [1, 2, 3, 4, 5, 6, 7, 8, 9]
    res = ''
    for i in range(9, 0, -1):
        if num in foo:
            res = ''.join((str(foo.pop(foo.index(num))), res))
            break
        else:
            num -= i
            res = ''.join((str(foo.pop(i - 1)), res))

    ans = int(res)

    return ans


for case in getCases():
    print(solve(case))