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())):
	n = int(input())
	l = '9 8 7 6 5 4 3 2 1'.split()
	i = 0
	s = ''
	while(n > 0):
		try:
			if(n - int(l[i]) >= 0):
				n -= int(l[i])
				s += l[i]
			i += 1
		except:
			print(-1)
			i = 0
			break
	if i != 0:
		print(''.join(sorted(s)) if n == 0 else -1)