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:
cases = int(input())
while cases:
    cases -= 1
    n = int(input())

    if n < 10:
        print(n)
    elif n > 45:
        print(-1)
    else:
        last = 9
        ans = 90
        n -= 9
        while n:
            ans += 1
            n -= 1
            if ans%10 == last:
                ans -= 1
                ans *= 10
                ans += 1
                last -= 1
        print(str(ans)[::-1])