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:
for _ in range(input()):
    x=input()
    l=[]
    if x>45:
        print -1
        continue
    for i in range(9,0,-1):
        if x<=i:
            l.append(x)
            break
        l.append(i)
        x-=i
    s=""
    for i in l:
        s+=str(i)
    print s[::-1]