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:
import sys
range = xrange
input = raw_input

t = int(input())
for _ in range(t):
    x = int(input())

    A = [10]
    while x:
        A.append(min(x,9,A[-1]-1))
        x -= A[-1]
        if A[-1] == 0:
            print -1
            break
    else:
        print ''.join(str(x) for x in A[1:][::-1])