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:
import functools

for _ in range(int(input())):
    x = int(input())
    if x<=9:
        print(x)
    elif x >=46:
        print(-1)
    else:
        check = []
        index = 9
        while x>0:
            if x>index:
                x-=index
                check.insert(0, index)
                index -= 1
            else:
                check.insert(0, x)
                x = 0

        print(functools.reduce(lambda a,b : str(a)+str(b),check))