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:
for _ in range(int(input())):
    x = int(input())
    if x>0 and x<10:
        print(x)
    elif x<18:
        print(str(x%10+1)+"9")
    elif x<25:
        print(str(1+x-18)+"89")
    elif x<31:
        print(str(x-24)+"789")
    elif x<36:
        print(str(x-30)+"6789")
    elif x<40:
        print(str(x-35)+"56789")
    elif x<43:
        print(str(x-39)+"456789")
    elif x<45:
        print(str(x-42)+"3456789")
    elif x==45:
        print(123456789)
    else:
        print(-1)