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.util.stream.*;

public class Solution {
	
    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
		int t = scan.nextInt();
		StringBuilder result = new StringBuilder();
		for(int i = 0; i < t; i++) {
			int n = scan.nextInt();
			String res = "-1";
			if(n <= 45) {
				List<Integer> a = new ArrayList<>();
				int d = 9;
				while(n > 0 && d > 0) {
					int numDec = 0;
					while(n < d) {
						d--;
						numDec++;
					}
					n -= d;
					a.add(d);
					if(numDec == 0) {
						d--;
					}
				}
				Collections.sort(a);
				res = a.stream().sorted().map (elem -> elem.toString()).collect(Collectors.joining(""));
			}
			result.append(res + "\n");
		}
		System.out.println(result);
    }		
}