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=input()
    if len(n)==1:
        print(n)
    else:
        n=int(n)
        m=n
        ss=9
        cnt=0
        flag=1
        ss=9
        b=[]
        while m and m<=45:
            while m<ss:
                ss-=1
            m-=ss  
            b.append(ss)
            cnt+=1
            if m==0:
                flag=1
                break
            if m<=0 or ss==0:
                flag=0
                break
            ss-=1
        if m>45:
            flag=0
        if flag:
            b.sort()
            for i in b:
                print(i,end="")
            print()
        else:
            print(-1)