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

#define REP(i,a,b) for(i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)

#define mygc(c) (c)=getchar_unlocked()
#define mypc(c) putchar_unlocked(c)

#define ll long long
#define ull unsigned ll

void reader(int *x){int k,m=0;*x=0;for(;;){mygc(k);if(k=='-'){m=1;break;}if('0'<=k&&k<='9'){*x=k-'0';break;}}for(;;){mygc(k);if(k<'0'||k>'9')break;*x=(*x)*10+k-'0';}if(m)(*x)=-(*x);}
void reader(ll *x){int k,m=0;*x=0;for(;;){mygc(k);if(k=='-'){m=1;break;}if('0'<=k&&k<='9'){*x=k-'0';break;}}for(;;){mygc(k);if(k<'0'||k>'9')break;*x=(*x)*10+k-'0';}if(m)(*x)=-(*x);}
void reader(double *x){scanf("%lf",x);}
int reader(char c[]){int i,s=0;for(;;){mygc(i);if(i!=' '&&i!='\n'&&i!='\r'&&i!='\t'&&i!=EOF) break;}c[s++]=i;for(;;){mygc(i);if(i==' '||i=='\n'||i=='\r'||i=='\t'||i==EOF) break;c[s++]=i;}c[s]='\0';return s;}
template <class T, class S> void reader(T *x, S *y){reader(x);reader(y);}
template <class T, class S, class U> void reader(T *x, S *y, U *z){reader(x);reader(y);reader(z);}
template <class T, class S, class U, class V> void reader(T *x, S *y, U *z, V *w){reader(x);reader(y);reader(z);reader(w);}

void writer(int x, char c){int s=0,m=0;char f[10];if(x<0)m=1,x=-x;while(x)f[s++]=x%10,x/=10;if(!s)f[s++]=0;if(m)mypc('-');while(s--)mypc(f[s]+'0');mypc(c);}
void writer(ll x, char c){int s=0,m=0;char f[20];if(x<0)m=1,x=-x;while(x)f[s++]=x%10,x/=10;if(!s)f[s++]=0;if(m)mypc('-');while(s--)mypc(f[s]+'0');mypc(c);}
void writer(double x, char c){printf("%.15f",x);mypc(c);}
void writer(const char c[]){int i;for(i=0;c[i]!='\0';i++)mypc(c[i]);}
void writer(const char x[], char c){int i;for(i=0;x[i]!='\0';i++)mypc(x[i]);mypc(c);}
template<class T> void writerLn(T x){writer(x,'\n');}
template<class T, class S> void writerLn(T x, S y){writer(x,' ');writer(y,'\n');}
template<class T, class S, class U> void writerLn(T x, S y, U z){writer(x,' ');writer(y,' ');writer(z,'\n');}
template<class T> void writerArr(T x[], int n){int i;if(!n){mypc('\n');return;}rep(i,n-1)writer(x[i],' ');writer(x[n-1],'\n');}

char memarr[17000000]; void *mem = memarr;
#define MD 1000000007

int isKado(int a, int b, int c){
  if(a==10 || b==10 || c==10) return 1;
  if(a != c && a < b && b > c) return 1;
  if(a != c && a > b && b < c) return 1;
  return 0;
}

int T; ll K;

int arr[15];
ll dp[2][15][11][11];

ll solve(int fit, int dep, int b1, int b2){
  int i, j, k;
  ll res = 0;

  if(dep < 0) return 1;
  if(dp[fit][dep][b1][b2] >= 0) return dp[fit][dep][b1][b2];

  if(fit){
    rep(i,arr[dep]+1){
      if(isKado(b1,b2,i)){
        res += solve(i==arr[dep]?1:0, dep-1, b2, (b2==10&&i==0)?10:i);
      }
    }
  } else {
    rep(i,10){
      if(isKado(b1,b2,i)){
        res += solve(0, dep-1, b2, (b2==10&&i==0)?10:i);
      }
    }
  }

  return dp[fit][dep][b1][b2] = res;
}

ll chk(ll n){
  int i,j,k,l;
  ll res;
  
  rep(i,2) rep(j,15) rep(k,11) rep(l,11) dp[i][j][k][l] = -1;
  k = 0;
  while(n) arr[k++] = n%10, n/=10;
  res = solve(1,k-1,10,10);
  return res;
}

int main(){
  int i, j, k;
  ll a, b, c, m;

  reader(&T);
  while(T--){
    reader(&K);

    K += 100;
    a = 0; b = 1e15;
    while(a < b){
      c = (a+b) / 2;
      m = chk(c);
      if(m < K) a = c + 1; else b = c;
    }

    writerLn(a);
  }

  return 0;
}