#include <bits/stdc++.h>

using namespace std;

long long dfs(int p, int x, const vector<vector<int> > &edges, vector<vector<long long> > &cnt) {
  if (p == 0) return cnt[p][x] = 1;
  if (cnt[p][x] != -1) return cnt[p][x];
  
  long long ret = 0;
  for (int q: edges[x]) {
    ret += dfs(p-1, q, edges, cnt);
  }
  
  return cnt[p][x] = ret;
}

string solve(int p, int x, long long k, const vector<string> &v, const vector<vector<int> > &edges, const vector<vector<long long> > &cnt) {
  if (p == 0) {
    assert (k == 0);
    return v[x];
  }
  
  string ret = v[x].substr(0, 1);
  
  for (int q: edges[x]) {
    if (k >= cnt[p-1][q]) {
      k -= cnt[p-1][q];
    } else {
      ret += solve(p-1, q, k, v, edges, cnt);
      break;
    }
  }

  return ret;
}

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);

  vector<string> v;
  v.push_back("0");

  for (int i = 0; i < 10; i++) {
    for (int j = 0; j < 10; j++) {
      for (int k = 0; k < 10; k++) {
        if (i == j || j == k || k == i) continue;
        int maxv = max({i, j, k});
        int minv = min({i, j, k});
        if (maxv == j || minv == j) {
          string s;
          s += char('0' + i);
          s += char('0' + j);
          s += char('0' + k);
          v.push_back(s);
        }
      }
    }
  }

  vector<vector<int> > edges(v.size());
  for (int i = 0; i < v.size(); i++) {
    for (int j = 0; j < v.size(); j++) {
      if (i == 0) {
        if (j == 0 || v[j][0] != '0')
          edges[i].push_back(j);
      } else {
        if (v[j].size() == 3 && v[i].substr(1) == v[j].substr(0, 2))
          edges[i].push_back(j);
      }
    }
  }

  vector<vector<long long> > cnt(16, vector<long long>(v.size(), -1));
  dfs(15, 0, edges, cnt);
  
  int T;
  cin >> T;
  
  while (T--) {
    long long k;
    cin >> k;
    string ans = solve(15, 0, k, v, edges, cnt);
    int i = 0;
    while (ans[i] == '0')
      ++i;
    cout << ans.substr(i) << endl;
  }
  
  return 0;
}