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 math
test = int(input())
for t in range(test):
    x = int(input())
    y = math.ceil(x/9)
    
    n = 9
    res = ""
    SUM = 0
    z = x
    #vis = set()
    while x > 0 and n > 0:
        #vis.add(min(n, x))
        res = str(min(n, x)) + res
        x = x-n
        n -= 1
        SUM += int(res[0])
        
    if SUM == z:
        print(int(res))
    else:
        print(-1)