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

#define int long long
typedef pair<int,int>pint;
typedef vector<int>vint;
typedef vector<pint>vpint;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,f,n) for(int i=(f);i<(n);i++)
#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)
template<class T,class U>inline void chmin(T &t,U f){if(t>f)t=f;}
template<class T,class U>inline void chmax(T &t,U f){if(t<f)t=f;}

int K;
int dp[100][10][10];

int N;
bool ok(int a,int b,int c){
    if(a==b||b==c||c==a)return false;
    return (a>b&&c>b)||(a<b&&c<b);
}

void solve(){
    memset(dp,0,sizeof(dp));
    cin>>K;K--;
    rep(i,10)rep(j,10)if(i!=j)dp[2][i][j]=1;
    reps(i,3,100){
        rep(j,10){
            rep(k,10){
                rep(l,10){
                    if(!ok(j,k,l))continue;
                    dp[i][j][k]+=dp[i-1][k][l];
                }
            }
        }
        int s=0;
        reps(j,1,10)rep(k,10)s+=dp[i][j][k];
        if(s>K){
            N=i;
            break;
        }
        K-=s;
    }

    vint ans;
    int pp,p;
    reps(i,1,10){
        rep(j,10){
            if(dp[N][i][j]<=K)K-=dp[N][i][j];
            else{
                pp=i;p=j;
                ans.pb(i);
                ans.pb(j);
                break;
            }
        }
        if(ans.size())break;
    }
    for(int i=N-1;i>=2;i--){
        rep(j,10){
            if(!ok(pp,p,j))continue;
            if(dp[i][p][j]<=K)K-=dp[i][p][j];
            else{
                pp=p;
                p=j;
                ans.pb(j);
                break;
            }
        }
    }

    rep(i,ans.size())cout<<ans[i];cout<<endl;
}

signed main(){
    int T;cin>>T;
    while(T--)solve();
    return 0;
}