#include <bits/stdc++.h>
using namespace std;
typedef long long int64;

int64 dp[2][3][11][10][500];  
string s;  
 
int64 rec(int idx, bool free, int pree, int pre, int pre_up)
{
  if(idx == s.size()) return(1);  
  if(~dp[free][pre_up][pree][pre][idx]) return dp[free][pre_up][pree][pre][idx];
  int64 ret = 0, end = free ? 9 : s[idx] - '0';  
  for(int i = 0; i <= end; i++) {
#define next(l) rec(idx + 1, free|(i != end), pre, i, l)  
    if(pre_up == 1 && pre <= i) continue;  
    if(pre_up == 2 && pre >= i) continue;
    if(pre_up == 0){
      if(pre && pre == i) continue;
      if(pre == 0) ret += next(0);  
      else if(pre < i) ret += next(1);  
      else if(pre > i) ret += next(2);  
    } else if(pre_up == 1) {
      if(pree == i) continue;
      ret += next(2);
    } else {
      if(pree == i) continue;
      ret += next(1);
    }
  }  
  return dp[free][pre_up][pree][pre][idx] = ret;
}  

int main()
{
  int T;
  cin >> T;

  while(T--) {
    int64 K;
    cin >> K;
    int64 low = 0, high = 37294859064823;
    while(high - low > 0) {
      int64 mid = (high + low) >> 1LL;
      stringstream sss; sss << mid;
      s = sss.str();
      memset(dp, -1, sizeof(dp));
      if(rec(0, 0, 0, 0, 0) - 91  < K) low = mid + 1;
      else high = mid;
    }
    cout << low << endl;
  }
}