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 PYTHON):

Solution:
def program(x):
    if x>45:
        return(-1)
    elif x<10:
        return(x)
    else:
        xr = 0
        for i in range(0,10):
            x = x -(9-i)
            xr+= pow(10,i)*(9-i)
            if x<(8-i):
                xr+= pow(10,i+1)*x
                break
        return xr

t = int(input())
while t > 0:
    x = int(input())
    print(program(x))
    t = t-1