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 o in range(t):
    x=int(input())
    j=x
    k=45-x
    sum=0
    i=0
    if(x>45):
        print(-1)
    else:
        while(i<10) :
            sum=sum+i
            if(sum>k):
                break
            i=i+1
        digits=10-i
        k=0
        i=1
        while(i<digits):
            j=j-(10-i)
            k=k+((10-i)*(10**(i-1)))
            i=i+1
        print((j*(10**(i-1)))+k)