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())
for z in range(t):
    n = int(input())
    if n>45:
        print("-1")
    else:
        arr = [1,2,3,4,5,6,7,8,9]
        s,i = n,8
        li = []
        while(s!=0):
            if s>=arr[i]:
                s-=arr[i]
                li.append(arr[i])
            i-=1
        for i in range(len(li)-1,-1,-1):
            print(li[i],end="")
        print()