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:

if __name__ == '__main__':
    t = int(input())
    for _ in range(t):
        x = int(input())
        mp = {}
        if x>45:
            print(-1)
        else:
            val, ans, cnt = 9, 0, 0
            while x>0:
                if x<val:
                    ans=ans+x*pow(10,cnt)
                    x=0
                else:
                    ans=ans+val*pow(10,cnt)
                    cnt+=1
                    x-=val
                    val-=1
            
            print(ans)