#include #include using namespace std; using ll = long long; using mint = atcoder::modint998244353; int main() { ios::sync_with_stdio(false); cin.tie(0); constexpr int r = 200000; auto check = [&](ll v){ int mn = 9, res = 0; while(v){ int r = v % 10; res += r; if(r > mn) return -1; mn = min(mn, r); v /= 10; } return res; }; vector tb(r + 1); for(int i = 0; i <= 9; i++) tb[i] = true; for(int i = 10; i <= r; i++){ int s = check(i); if(s == -1) continue; tb[i] = tb[s]; } int T; cin >> T; while(T--){ ll n; cin >> n; // 桁和の最低値 ll mn = n + 1; string str = "00" + to_string(mn); // mn以上の値で桁DP int len = str.size(), tot = len * 9; vector dp(2, vector(10, 1ll << 62)); dp[1][0] = 0; for(int i = 0; i < len; i++){ vector ndp(2, vector(10, 1ll << 62)); for(int j = 0; j < 2; j++){ for(int k = 0; k < 10; k++){ int low2 = str[i] - '0'; int low = j ? max(k, low2) : k; if(dp[j][k] >> 62) continue; for(int nv = low; nv < 10; nv++){ ndp[j & (low2 == nv)][nv] = min(ndp[j & (low2 == nv)][nv], dp[j][k] * 10 + nv); } } } swap(dp, ndp); } mn = 1ll << 62; for(int i = 0; i < 2; i++){ for(int j = 0; j < 10; j++){ int k = check(dp[i][j]); if(k != -1 && tb[k]) mn = min(mn, dp[i][j]); } } ll keta = max(n + 1, (mn + 8) / 9); mint ans; ans += (mint(10).pow(keta) - 1) / 9; mn -= keta; ll keta2 = mn / 8; ans += (mint(10).pow(keta2) - 1) * 8 / 9; mn -= keta2 * 8; ans += mint(10).pow(keta2) * mn; cout << ans.val() << '\n'; } }