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

Solution:
import java.util.*;
import java.io.*;

public class Test {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int t = sc.nextInt();
		while(t>0) {
			t--;
			int n = sc.nextInt();
			if(n>45) {
				System.out.println("-1");
			}else {
				int sum = 0,num=0;
				int i=9;
				while(num<n) {
					if(num+i <= n) {
						sum = sum*10 + i;
						num += i;
					}
					i--;
				}
				int ans = 0;
				while(sum>0) {
					int d = sum%10;
					ans = ans*10 +d;
					sum /= 10;
				}
				System.out.println(ans);
			}
		}

	}

}