#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll ILL=2167167167167167167;
const int INF=2100000000;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> int LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> int UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,T b){if(b<a){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
bool yneos(bool a,bool upp=false){if(a){cout<<(upp?"YES\n":"Yes\n");}else{cout<<(upp?"NO\n":"No\n");}return a;}
template<class T> void vec_out(vector<T> &p,int ty=0){
    if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}
    else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}
template<class T> T square(T a){return a * a;}

#include <atcoder/modint>
using mint = atcoder::modint998244353;

bool f(ll x){
    if (x < 10) return true;
    ll sum = 0;
    ll tmp = INF;
    while (x){
        ll r = x % 10;
        x /= 10;
        sum += r;
        if (tmp < r) return false;
        tmp = r;
    }
    return f(sum);
}

ll upd(ll tmp){
    auto X = to_string(tmp);
    rep(i, 1, X.size()){
        if (chmax(X[i], X[i - 1])){
            rep(j, i, X.size()) X[j] = X[i];
            break;
        }
    }
    tmp = stol(X);
    return tmp;
}

void solve();
// POP'N ROLL MUSIC / TOMOO
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    cin >> t;
    rep(i, 0, t) solve();
}

void solve(){
    ll N;
    cin >> N;
    ll tmp = N;
    do{
        tmp++;
        tmp = upd(tmp);
        // cout << X << endl;
    }while(!f(tmp));
    // digi を求める
    ll D = max((tmp + 8) / 9, N + 1);
    // A + B + C * 9 = tmp
    // A + 1 + C = D

    ll C = (tmp - D) / 8;
    if (C == D){
        cout << (((mint)(10)).pow(D) - 1).val() << "\n";
        return;
    }
    ll B = (tmp - C * 8) - D + 1;
    ll A = D - C - 1;
    // cout << tmp << " " << A << " " << B << " " << C << endl;
    mint ans = (((mint)(10)).pow(C) * (B + 1) - 1);
    ans += (((mint)(10)).pow(D) - (mint(10)).pow(C + 1)) / 9;
    cout << ans.val() << "\n";
}