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:
from collections import *
from math import *
from itertools import *
def I():return map(int , input().strip().split())
dp = defaultdict(list)
arr = []
piv = [i for i in range(1, 10)]
for i in range(1, 10):
	arr.append(list(combinations(piv, i)))
for i in arr:
	for j in i:
		if len(dp[sum(j)]) == 0:dp[sum(j)] = [k for k in j]
for T in range(int(input())):
	n = int(input())
	if len(dp[n]) == 0:print(-1)
	else:print(*dp[n],sep='')