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:
index = int(raw_input())

for f in range(index):
    n=int(raw_input())
    result=''
    num=0
    for i in range(9,-1,-1):
        if(i<=n):
            result+=str(i)
            n-=i
        if(n==0):
            num=1
            break
    if(num==1):
        result=sorted(result)
        print(''.join(result))
    elif(num != 1):
        print(-1)