#include <bits/stdc++.h>
#include <atcoder/modint>
using mint=atcoder::modint998244353;
using namespace std;
using ll=long long;
int main(){
	int ttt;
	cin>>ttt;
	vector<ll> p(18,1);
	for(int i=1;i<18;i++)p[i]=p[i-1]*10;
	auto is_ok=[](int x)->bool{
		while(1){
			auto s=to_string(x);
			if(s.size()==1)return true;
			for(int i=0;i+1<s.size();i++)if(s[i]>s[i+1])return false;
			int y=0;
			for(int i=0;i<s.size();i++)y+=s[i]-'0';
			x=y;
		}
	};
	while(ttt--){
		ll n;
		cin>>n;
		ll now=n+1;
		mint ans=(((mint)10).pow(n+1)-1)/9;
//		cout<<ans.val()<<endl;
		int dsum=0;
		while(1){
			auto s=to_string(now);
			for(int i=0;i+1<s.size();i++){
				if(s[i]>s[i+1]){
					for(int j=i+1;j<s.size();j++)s[j]=s[i];
					break;
				}
			}
			now=stoll(s);
			dsum=0;
			for(int i=0;i<s.size();i++)dsum+=s[i]-'0';
			if(is_ok(dsum))break;
			else now++;
		}
		ll cost=now-(n+1);
		ll x=cost/8,y=cost%8;
		ans+=(((mint)10).pow(x)-1)/9*8;
		ans+=((mint)10).pow(x)*y;
		cout<<ans.val()<<endl;
	}
}