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 PYTHON):

Solution:
import collections

def f(x):
	if x > 45: return -1
	q = collections.deque([e for e in range(9 ,0, -1)])
	r = []
	while(q and x):
		if q[0] <= x:
			x-= q[0]
			r.append(q[0])
		q.popleft()
	r.sort()
	
	return ''.join(map(str, r))  if x == 0 else -1




	
for u in range(int(raw_input())):
	ans = f(int(raw_input()))
	print ans