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:
T = int(input())
for t in range(T):
    x = int(input())
    if x < 10:
        print(x)
        continue
    if x < 18:
        print((x-9)*10 + 9)
        continue
    if x < 25:
        print((x-17)*100 + 89)
        continue
    if x < 31:
        print((x-24)*1000 + 789)
        continue
    if x < 36:
        print((x-30)*10000 + 6789)
        continue
    if x < 40:
        print((x-35)*100000 + 56789)
        continue
    if x < 43:
        print((x-39)*1000000 + 456789)
        continue
    if x < 45:
        print((x-42)*10000000 + 3456789)
        continue
    if x < 46:
        print(123456789)
        continue
    print(-1)