#define MD 998244353
int d[150]{};
rep(i,10){
	d[i]=1;
}
rep(i,10,150){
	int a=i/100,b=i/10%10,c=i%10;
	if(a<=b<=c){
		d[i]=d[a+b+c];
	}
}
ll@t;
rep(t){
	ll@n;
	redo_n:
	++n;
	if(1){
		int e[16];
		ll nn=n;
		rep(i,16){
			e[i]=nn%10;
			nn/=10;
		}
		ll s=0;
		bool f=false;
		rrep(i,15){
			if(e[i]<e[i+1]){
				f=true;
			}
			if(f){
				e[i]=e[i+1];
			}
			s+=e[i];
		}
		while(!d[s]){
			ll t=0;
			while(e[t]==9){
				++t;
			}
			e[t]+=1;
			s+=1;
			while(t--){
				e[t]=e[t+1];
				s+=e[t]-9;
			}
		}
		if(s>n*9){
			goto redo_n;
		}
		ll u=0;
		rrep(i,16){
			u=u*10+e[i];
		}
		u-=n;
		ll a=u/8;
		ll r=u%8;
		Mint z=(Mint(10)**n-1)/9+(Mint(10)**a-1)/9*8+Mint(10)**a*r;
		wt(z);
	}
}