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:
# from sys import stdin
# input=stdin.readline
# map(int,input().split())
# list(map(int,input().split()))
# def ceil(c):
#     if int(c)==c:
#         return c
#     return int(c)+1
#
# def floor(f):
#     return int(f)
# def sqrt(s): #returns float
#     return s**(0.5)


def solve(n):
    if n>45:
        return -1
    if n<10:
        return n
    s="9"
    n-=9
    for i in range(8,0,-1):
        if n>=i:
            s+=str(i)
            n-=i
        if n==0:
            break
    return s[::-1]


for _ in range(int(input())):
    print(solve(int(input())))