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:
test=int(input())
for testcase in range(test):
    n=int(input())
    if(n<=45):
        if(n<10):
            print(n)
        else:
            i=9
            s=0
            ans=0
            while(i>0):
                #print(i)
                if(s+i<=n):
                    s+=i
                    ans=(ans*10)+i
                    
                if(s>=n):
                    break
                i-=1
                
            if(n==s):
                ans=str(ans)
                print(ans[::-1])
            else:
                print(-1)
    else:
        print(-1)