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())
for _ in range(t):
    x = int(input())
    if x > 45:
        print(-1)
    else:
        l = 0
        while l*(l+1)//2+((9-l)*l) < x:
            l += 1
        s = []
        for i in range(10-l, 10):
            s += [i]
        while sum(s)>x:
            s[0] -= 1
        for i in s:
            print(i, end='')
        print()