#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <cassert>
#include <limits>
#include <functional>
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#if defined(_MSC_VER) || __cplusplus > 199711L
#define aut(r,v) auto r = (v)
#else
#define aut(r,v) __typeof(v) r = (v)
#endif
#define each(it,o) for(aut(it, (o).begin()); it != (o).end(); ++ it)
#define all(o) (o).begin(), (o).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset(m,v,sizeof(m))
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
using namespace std;
typedef vector<int> vi; typedef pair<int, int> pii; typedef vector<pair<int, int> > vpii; typedef long long ll;
template<typename T, typename U> inline void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> inline void amax(T &x, U y) { if(x < y) x = y; }

bool isok(int a, int b, int c) {
	return a != b && a != c && b != c && (min({ a, b, c }) == b || max({ a, b, c }) == b);
}

ll memo[30][11][11][2];
ll rec(int i, int pd, int pp, bool ppp) {
	ll &r = memo[i + 1][pd + 1][pp + 1][ppp];
	if(r != -1) return r;
	if(i == -1) return r = ppp ? 1 : 0;
	r = 0;
	rep(d, 10) {
		if(pp == -1 || isok(pp, pd, d)) {
			r += rec(i - 1, pd == -1 && d == 0 ? -1 : d, pd, pp != -1);
			if(r > INFL) r = INFL;
		}
	}
	return r;
}

string ans;
void solve(ll k, int i, int pd, int pp, bool ppp) {
	if(i == -1)
		return;
	rep(d, 10) {
		if(pp == -1 || isok(pp, pd, d)) {
			int nd = pd == -1 && d == 0 ? -1 : d;
			ll t = rec(i - 1, nd, pd, pp != -1);
			if(k < t) {
				ans += char('0' + d);
				return solve(k, i - 1, nd, pd, pp != -1);
			}
			k -= t;
		}
	}
}

int main() {
	mset(memo, -1);
	int T;
	scanf("%d", &T);
	for(int ii = 0; ii < T; ++ ii) {
		long long K;
		scanf("%lld", &K);
		ans.clear();
		solve(K - 1, 28, -1, -1, false);
		{
			int i = 0;
			while(ans[i] == '0') ++ i;
			ans = ans.substr(i);
		}
		puts(ans.c_str());
	}
	return 0;
}