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())

numList = []

cont = 10
numLim = 9
num = "9"
while numLim > 1:
  for i in range(1, numLim):
    numList.append(str(i) + num)
    if i == numLim - 1:
      num = str(i) + num
  numLim -= 1

nums = []
for i in range(t):
  nums.append(int(input()))

for num in nums:
  if num <= 9:
    print(num)
  elif num <= 45:
    print(numList[num-10])
  else:
    print(-1)