#include <bits/stdc++.h>
using namespace std;

#define mod 998244353

long long modpow(long long n, long long m) {
	long long ans = 1;
	long long k = n;
	while (m) {
		if (m & 1) ans = ans * k % mod;
		m >>= 1;
		k = k * k % mod;
	}
	return ans;
}

void solve() {
	long long n; cin >> n;
	long long ans = (modpow(10, n+1)-1) * modpow(9, mod-2) % mod;
	n++;
	while (10 <= n) {
		string s = to_string(n);
		long long m = 0;
		int M = 0;
		for (auto& c : s) {
			int x = c - '0';
			M = max(M, x);
			ans += M - x;
			m += M;
		}
		n = m;
		ans %= mod;
	}
	cout << ans << endl;
}


int main() {
	int t; cin >> t;
	while (t--) solve();
}