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:
from sys import stdin
t = int(stdin.readline())
a = '123456789'
di= {}
for mask in xrange(1,512):
    s = ''
    cur = 0
    for i in xrange(9):
        if mask & (1<<i):
            s += a[i]
            cur += int(a[i])
    y = di.get(cur,10**18)
    di[cur] = min(y,int(s))
for _ in xrange(t):
    n = int(stdin.readline())
    print di.get(n,-1)