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:
def solution(n):
    ans=[]
    last=9
    sm=0
    while(sm<n and last>0):
        ans.append(str(min(last,n-sm)))
        sm+=last
        last-=1
    if(sm<n):
        return -1
    
    return "".join(ans[::-1])
for i in range(int(input())):
    n=int(input())
    print(solution(n))