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:
t = int(input())
i = 0
while i < t:
    x = int(input())
    if x % 100 < 10:
        print(x)
    else:
        j = 9
        out = []
        while j > 0 and x >= j:
            x -= j
            out.append(str(j))
            j -= 1
        if str(x) not in out and x % 100 < 10 and x > 0:
            out.append(str(x))
            x = 0
        if x > 0:
            print(-1)
        else:
            s = ''.join(out)
            print(s[::-1])
    i += 1