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:
res = {}
dig=[0,1,2,3,4,5,6,7,8,9]
for i in range(1,2**10):
  s=0
  _str=""
  for j in range(10):
    if(1<<j & i):
        s+=dig[j]
        _str+=str(dig[j])
  aux=res.get(s)
  if(aux!=None): 
    if(aux>int(_str)):       res[s] = int(_str)
  else:     res[s] = int(_str)

for i in range(int(input())):    
    e=int(input())
    r=res.get(e)
    if(r!=None):        print(r)
    else:       print(-1)