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:
from sys import stdout, stdin
input = stdin.readline
print = stdout.write


def main():
    mp = lambda: map(int, input().strip().split())
    it = int
    t = it(input())
    for _ in [0] * t:
        x = it(input())
        a = list(range(9, 0, -1))
        if x <= 45:
            s = ''
            while x:
                i = 0
                while a[i] > x:
                    i += 1
                x -= a[i]
                s += str(a.pop(i))
            print(s[::-1] + '\n')
        else:
            print(str(-1) + '\n')

main()