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 nums(n):
    t=n
    a=[9,8,7,6,5,4,3,2,1]
    ans=[]
    i=0
    while n and i<len(a):
        if a[i]<=n:
            n-=a[i]
            ans.append(a[i])
            a.pop(i)
        else:
            i+=1
    if sum(ans)!=t:
        return -1
    return "".join(map(str,sorted(ans)))

for i in range(int(input())):
    print(nums(int(input())))