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:
t = int(input())
for _ in range(t):
    n = int(input())
    s = 0
    ans = []
    for i in range(513):
        k = str(bin(i))[2:]
        k = k[::-1]
        k = k+'0'*(10-len(k))
        p = 0
        for j in range(1,10):
            p+=j*int(k[j-1])
        if p == n:
            ans.append(k)
    for i in range(len(ans)):
        s = ''
        for j in range(10):
            if ans[i][j] == '1':
                s+=str(j+1)
        ans[i] = int(s)
    l = 999999999999

    for f in ans:
        l = min(l,f)
    if l == 999999999999:
        print(-1)
    else:
        print(l)