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:

T = input()

for t in range(T):
    n = input()

    if n < 10:
        print n
        continue

    if n>45:
        print -1
        continue
    
    num = 9
    l = []
    sum1 = 0
    possible = 1

    while num>0 and n>0:
        if num <= n-sum1:
            l.append(num)
            sum1 += num
            num -= 1
        
        else:
            if (n-sum1) in l:
                possible = -1
                
            else:
                l.append(n-sum1)
            
            break
    
    if possible == -1:
        print -1
        continue
    
    rev = ''

    for i in range(len(l)):
        rev = str(l[i]) + rev
    
    print int(rev)