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 t in range(int(input())):
    n=int(input())
    if(n<=45):
        a=[0]
        b=[0,9,8,7,6,5,4,3,2,1]
        for i in range(9,0,-1):
            a.append(a[-1]+i)
        for i in range(10):
            if(a[i]>n):
                break
        k=n-a[i-1]
        y=""
        if(k>0):
            y+=str(k)
        j=i-1
        while(j>=1):
            y+=str(b[j])
            j-=1
        print(y)
    else:
        print(-1)