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 CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int t;
  cin >> t;
  while (t--) {
    int x;
    cin >> x;
    vector<int> res;
    for (int i = 9; i >= 1 && x > 0; i--) {
      int cur = min(i, x);
      x -= cur;
      res.push_back(cur);
    }
    if (x > 0) {
      cout << "-1\n";
    } else {
      sort(res.begin(), res.end());
      for (int p : res)
        cout << p;
      cout << '\n';
    }
  } 
  return 0;
}