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

public class Main {
  public static void main(String[] args) {
    Scanner in = new Scanner(System.in);
    int t = in.nextInt();

    for (int i = 0; i < t; i++) {
      List<Integer> a = new ArrayList<>();
      int n = in.nextInt();
      
      if (n > 45)
        System.out.println(-1);
      else {
        for (int j = 9; n > j && j >= 0; j--) {
          a.add(j);
          n -= j;
        }
      
        a.add(n);
        
        for (int j = a.size() - 1; j >= 0; j--)
          System.out.print(a.get(j));
        System.out.println();
      }
    }
  }
}