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:
def suma(n):
  s=0
  while n!=0 :
    s=s+n%10
    n=n//10
  return s
  
te=int(input())
for i in range(te):
  num=int(input())
  res="987654321"
  if num>45:
    print("-1")
  else:
    for i in range(100):
      if res[-1]=="0":
        res=res[:-1]
      if suma(int(res))==num:
        print(res[::-1])
        break
      res=str(int(res)-1)