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())):
    n=int(input())
    if n <= 9:
        print(n)
    elif n<=17:
        print(n-9,'9',sep='')
    elif n<=24:
        print(n-17,'89',sep='')
    elif n<=30:
        print(n-24,'789',sep='')
    elif n<=35:
        print(n-30,'6789',sep='')
    elif n<=39:
        print(n-35,'56789',sep='')
    elif n<=42:
        print(n - 39, '456789', sep='')
    elif n<=44:
        print(n - 42, '3456789', sep='')
    elif n<=45:
        print(n - 44, '23456789', sep='')
    else:
        print('-1')