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.io.*;
import java.util.*;

public class Main{

	public static void main(String[] args) throws IOException{
		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));

		int t = Integer.parseInt(in.readLine());
		while(t -- > 0){
			
			int x = Integer.parseInt(in.readLine());
			
			if(x > 45) {
				System.out.println(-1);
				continue;
			}
			
			int cur = 9;
			String res = "";
			while(x > cur) {
				res = cur + res;
				x -= cur;
				cur -= 1;
			}
			if(x > 0) res = x + res;
			System.out.println(res);
		}
	}
}