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())
while t>0:
    f=0
    num=987654321
    sum=45
    n=int(input())
    if(n>45):
        print("-1")
        t-=1
        continue
    else:
        while(f<45):
            if(sum==n):
                break
            elif(num%10==1):
                num=int(num/10)
                sum=sum-1
            else:
                num=num-1
                sum=sum-1
            f+=1
    print(str(num)[::-1])
    t-=1