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:
for _ in range(int(input())):
    x= int(input())
    s=0
    i=0
    ans=''
    while(s!=x):
        if(x>9-i):
            ans=str(9-i)+ans
            x-=9-i
            i+=1
            
        else:
            ans=str(x)+ans
            x=0
        if(i==9 and x!=0):
            ans='-1'
            break
    print(ans)