#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

using mint = modint998244353;

void debug_mint1(vector<mint> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        cerr << vec[i].val() << " ";
    }
    cerr << endl;
}

void debug_mint2(vector<vector<mint>> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        for (int j = 0; j < vec[i].size(); j++) {
            cerr << vec[i][j].val() << " ";
        }
        cerr << endl;
    }
}

void dfs(vector<ll> &monos, ll now, ll last){
    monos.push_back(now);
    if (to_string(now).size() == 15){
        return;
    }
    if (last == 0){
        for (ll i = 1; i <= 9; i++){
            dfs(monos, now * 10 + i, i);
        }
    }
    else{
        for (ll i = last; i <= 9; i++){
            dfs(monos, now * 10 + i, i);
        }
    }
}

int main(){
    // まず先に、15 桁以下の monotonic なものを求める
    vector<ll> monos(0);
    dfs(monos, 0, 0);
    sort(all(monos));

    ll len = monos.size();

    set<ll> forever_monos;
    for (ll i = 0; i < len; i++){
        if (monos[i] <= 9){
            forever_monos.insert(i);
        }
        else{
            ll keta = 0;
            string sm = to_string(monos[i]);
            for (ll j = 0; j < sm.size(); j++){
                keta += (ll)(sm[j] - '0');
            }
            if (forever_monos.find(keta) != forever_monos.end()){
                forever_monos.insert(monos[i]);
            }
        }
    }
    // cout << forever_monos.size() << endl;

    ll T;
    cin >> T;
    while (T--){
        ll N;
        cin >> N;

        ll ub = *(forever_monos.lower_bound(N + 1));

        // 下の桁から埋める
        ll div = (ub - (N + 1)) / 8;
        ll rem = (ub - (N + 1)) % 8;

        ll lower = 1;
        ll mid = 1 + rem;
        ll upper = 9;

        ll lower_cnt = N - div;
        ll mid_cnt = 1;
        ll upper_cnt = div;

        // debug_out(lower, mid, upper, lower_cnt, mid_cnt, upper_cnt);

        mint ans_lower = mint(10).pow(lower_cnt);
        ans_lower -= mint(1);
        ans_lower /= mint(9);
        ans_lower *= mint(lower);

        mint ans_mid = mint(mid);

        mint ans_upper = mint(10).pow(upper_cnt);
        ans_upper -= mint(1);
        ans_upper /= mint(9);
        ans_upper *= mint(upper);

        mint ans = ans_lower * mint(10).pow(mid_cnt + upper_cnt) + ans_mid * mint(10).pow(upper_cnt) + ans_upper;
        cout << ans.val() << endl;
    }
}