#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)

int main() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    int t;
    cin >> t;
    map<int, int> mp;
    rep(i, 40) {
        mp[i] = 100000;
    }
    rep(i, 100000) {
        vector<int> v(5);
        int k = i;
        rep(j, 5) {
            v[j] = k % 10;
            k /= 10;
        }
        reverse(v.begin(), v.end());
        if (v[0] > v[1] + v[2] || v[1] > v[2] + v[3] || v[2] > v[3] + v[4]) {
            mp[v[0] + v[1] + v[2] + v[3] + v[4]] = min(i, mp[v[0] + v[1] + v[2] + v[3] + v[4]]);
        }
    }
    while (t--) {
        int k;
        cin >> k;
        int d = 0;
        while (k >= 36) {
            k -= 9;
            d++;
        }
        cout << mp[k];
        rep(i, d) cout << 9;
        cout << endl;
    }
    return 0;
}