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())
res=[]
for i in range(t):
  n=int(input())
  atual = 9
  num=[]
  soma = sum(num)
  a=True
  while n!=0:
    if n-atual>=0:
      num.append(atual)
      n-=atual
      atual-=1 
    else:
      atual-=1
    if atual<0:
      res.append([-1])
      a=False
      break
  if a:
    num.sort()
    res.append(num)
for r in res:
  print()
  for item in r:
    print(item,end='')