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

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

void solve() {
	long long n; cin >> n;
	string s = to_string(n);
	
	vector dp(size(s), vector(2, vector(10, vector<mint>(10, mint{})))); dp[0][1][0][0] = 1;
	for (int i=0; i<ssize(s)-1; i++) {
		for (auto j : {0, 1}) {
			for (int k=0; k<10; k++) {
				for (int l=0; l<10; l++) {
					int M = (j ? s[i]-'0' : 9);
					for (int m=max(0, k-l); m<M; m++) {
						dp[i+1][0][l][m] += dp[i][j][k][l];
					}
					if (k <= l+M) dp[i+1][j][l][M] += dp[i][j][k][l];
				}
			}
		}
	}
	
	mint ans = 0;
	for (auto j : {0, 1}) {
		for (int k=0; k<10; k++) {
			for (int l=0; l<10; l++) {
				int M = (j ? s.back()-'0' : 9);
				for (int m=max(0, k-l); m<=M; m++) {
					if (l+1 < k) ans += dp.back()[j][k][l] * (10 - m);
					else ans += dp.back()[j][k][l] * (100 - 10*l - m);
				}
			}
		}
	}
	
	mint N = n;
	cout << (N * (N+1) / 2 + ans - 100).val() << '\n';
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int T; cin >> T;
	while (T--) solve();
}