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 main():
    n = int(input())
    output = []
    for i in range(n):
        x = int(input())
        y = x
        for i in range(9, 0, -1):
            if x - i >= 0:
                output.append(i)
                x -= i
        if sum(output) != y:
            print(-1)
        else:
            print("".join(sorted([str(x) for x in output])))
        output = []


if __name__ == "__main__":
    main()