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:
import sys; import math; 
CASE=1; rla=''

mp=[9, 8, 7, 6, 5, 4, 3, 2, 1]


def solve() : 
    n=int(input())
    if n<10 or n>45 : 
        print(n if n<10 else -1)
        return
    
    ans=''; x=9
    
    while n>0 and x>0 : 
        while x>n : x-=1
        n-=x; ans+=chr(x+ord('0'))
        x-=1
    
    print(ans[::-1] if n==0 else -1)

while True : 
    rla=sys.stdin.readline()
    cases=1
    if not rla: break
    if (rla=='\n')|(rla=='') : continue
    if CASE==1 : cases=int(rla)
    for cas in range(cases) : 
        
        solve()