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:
def Unique(x):
    if x<10:
        return x
    elif x<18:
        return str(x-9)+'9'
    elif x<25:
        return str(x-17)+'89'
    elif x<31:
        return str(x-24)+'789'
    elif x<36:
        return str(x-30)+'6789'
    elif x<40:
        return str(x-35)+'56789'
    elif x<43:
        return str(x-39)+'456789'
    elif x<45:
        return str(x-42)+'3456789'
    elif x==45:
        return 123456789
    elif x>45:
        return -1
            
t=int(input())
for _ in range(t):
     n=int(input())
     print(int(Unique(n)))