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;

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

    int t = sc.nextInt();
    for (int tc = 0; tc < t; ++tc) {
      int x = sc.nextInt();

      System.out.println(solve(x));
    }

    sc.close();
  }

  static int solve(int x) {
    int result = Integer.MAX_VALUE;
    for (int code = 0; code < 1 << 9; ++code) {
      int value = 0;
      int digitSum = 0;
      for (int i = 0; i < 9; ++i) {
        if ((code & (1 << i)) != 0) {
          int digit = i + 1;
          value = value * 10 + digit;
          digitSum += digit;
        }
      }

      if (digitSum == x) {
        result = Math.min(result, value);
      }
    }

    return (result == Integer.MAX_VALUE) ? -1 : result;
  }
}