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:

for _ in range(int(input())):
	x=int(input())
	if(x>45):
		print(-1)
	elif(x<10):
		print(x)
	elif(x>9 and x<18):
		z=x-9
		print(z, end="")
		print(x-z)
	elif(x>17 and x<25):
		z=x-17
		print(z, end="")
		print(89)
	elif(x>24 and x<31):
		z=x-24
		print(z, end="")
		print(789)
	elif(x>30 and x<36):
		z=x-30
		print(z, end="")
		print(6789)
	elif(x>35 and x<40):
		z=x-35
		print(z, end="")
		print(56789)
	elif(x>39 and x<43):
		z=x-39
		print(z, end="")
		print(456789)
	elif(x>42 and x<45):
		z=x-42
		print(z, end="")
		print(3456789)
	elif(x==45):
		print(123456789)