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())
for test in range(0,t):
	n = int(input())
	if n>45:
		print(-1)
	elif n==44:
		print(23456789)
	elif len(str(n))==1:
		print(n)
	else:
		s = ''
		big = 9
		while(len(str(n))>1):
			n = n-big
			s = s+str(big)
			big = big-1
		if n<=big:
			s = s+str(n)
			s = s[::-1]
			print(int(s))
		else:
			if n%2==0 and n//2==big:
				s = s+str(big)+str(big-1)+str(1)
				s = s[::-1]
				print(int(s))
			else:
				k = n-big
				s = s+str(big)+str(k)
				s = s[::-1]
				print(int(s))