#include<bits/stdc++.h>
using namespace std;
#define nl "\n"
#define fi first
#define se second
#define pb push_back
#define ll long long
#define ull unsigned ll
#define RV  return void
// #define inf 2000000000
#define sz(x) int(x.size())
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define Mini(x) *min_element(all(x))
#define Maxi(x) *max_element(all(x))
#define fixed(n) fixed << setprecision(n)
#define ceil(w, m) (((w) / (m)) + ((w) % (m) ? 1 : 0))
#define cin(v) for (auto&i:v) cin >> i;
#define cout(v) for (auto&i:v) cout << i << " ";
#define clr(memo, x) memset(memo, x, sizeof memo)
#define updmin(a, b) a = min(a, b)
#define updmax(a, b) a = max(a, b)
#define vi vector < int >
#define vl vector < ll >
#define vc vector < char >
#define vs vector < string >
#define v2i vector < vector < int > >
#define v2l vector < vector < int > >
#define seti set < int >
#define setl set < ll >
#define mapii map < int , int >
#define mapll map < ll , ll >
#define mapli map < ll , int >
#define mapci map < char , int >
#define mapsi map < string , int >
#define pll pair < ll , ll >
#define pii pair < int , int >
#define range(l,r,x) for(int i=l ; i < r ; i+=x)
#define FastCode ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
vector < string > ternary= {"NO\n" , "YES\n"};

void  Zainab(){
            #ifndef ONLINE_JUDGE
              freopen("input.txt", "r", stdin);
              freopen("output.txt", "w", stdout);
            #endif
}


/*================================  solution  ================================ */

ll dp [13][2];

string S ;



ll rec(int idx , bool sm ){
    if(idx >= sz(S)) return 1;

    ll &ret = dp[idx][sm];
    if(~ret) return ret;

    ret =0;
    for(int i =0 ; i <= 9 ; i++){
        if(i==4) continue;
        if(i > S[idx]-'0' and !sm) break;
        ret += rec(idx+1 , sm or  i < S[idx]-'0');
    }

    return ret ;
}


void build(int idx , bool sm , ll sum ){


    if(idx >= sz(S)) return ;



    for(int i =0 ; i <= 9 ; i++){
        if(i==4) continue;
        if(i > S[idx]-'0' and !sm) break;;


        ll  ret = rec(idx+1 , sm or  i < S[idx]-'0');

        if(ret < sum ) sum-=ret;
        else {
            cout << i ;
            build(idx+1 , sm or  i < S[idx]-'0' , sum );
            return ;
        }
    }

}


void myCode(){



ll k;
cin >> k ;

clr(dp,-1);
S=to_string(k);

while(sz(S) < 13) S = "0"+S;


build(0,0,k);
cout << nl;



}


int main(){

FastCode ;
Zainab() ;





            int testCase=1;
                cin >> testCase ;
            for(int i=1 ; i<= testCase ; i++){
                //  cout << "Case #" << i << ": ";
                myCode();
            }


    return 0;
}