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.Scanner;
//1462c
public class UniqueNumber {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int t = sc.nextInt();
        while(t-->0){
            int n = sc.nextInt();
            System.out.println(isUnique(n));
        }
    }

    public static int isUnique(int n){
        if(n>45) return -1;
        boolean[] arr = new boolean[10];
        int x = 9;
        while(n>0){
            if(n>=x){
                arr[x] = true;
                n-=x;
            }
            x--;
        }
        int ans = 0;
        for (int i = 1; i <= 9; i++) {
            if(arr[i]){
                ans = ans*10+i;
            }
        }
        return ans;
    }
}