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

Solution:
#include <bits/stdc++.h>

using namespace std;

int main()
{
	int T;	scanf("%d", &T);
	while (T--) {
		int n;	scanf("%d", &n);

		vector <int> d(10);
		for (int i = 0; i < 10; i++)
			d[i] = i;

		do {
			int sum = 0, num = 0;
			for (int x : d) {
				x = 9 - x;
				sum += x;
				num = 10*num + x;
				if (sum == n) {
					string ans = to_string(num);
					sort(ans.begin(), ans.end());
					printf("%s\n", ans.c_str());
					goto END;
				}
				else if (sum > n)
					break;
			}
		} while (next_permutation(d.begin(), d.end()));

		printf("-1\n");
		END:;
	}

	return 0;
}