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 PYTHON):

Solution:
for _ in range(int(input())):
    n=int(input())

    def solve(n):

        if(len(str(n)))==1:
            return n

        if n>45:
            return -1



        ans=["9"]
        n-=9
        while n>0:
            if n>=9:
                last=int(ans[-1])
                ans.append(str(last-1))
                n-=last-1

            else:
                if n!=0 and str(n) not in ans:
                    ans.append(str(n))
                    n-=n
                else:
                    last=n
                    while str(last) in ans and last>0:
                        last-=1
                    if last==0:
                        return -1
                    else:
                        ans.append(str(last))
                        n-=last



        #return ans
        if(len(ans))!=len(set(ans)) or n!=0:
            return -1
        else:
            ans.reverse()
            return "".join(ans)


    print(solve(n))