#include #include using namespace std; using ll = long long; using mint = atcoder::modint998244353; int main() { ios::sync_with_stdio(false); cin.tie(0); auto check = [&](int 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; }; constexpr int r = 200000; 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]; } auto check2 = [&](ll v){ int mn = 9, res = 0; while(v){ int r = v % 10; res += r; if(r > mn) return false; mn = min(mn, r); v /= 10; } return tb[res] ? true : false; }; array tmp{}; auto update = [&](ll v){ int idx = 0; while(v){ int r = v % 10; tmp[idx++] = r; v /= 10; } ll res = 0; int mx = 0; bool flg = false; while(idx >= 0){ if(flg){ res *= 10; res += mx; }else{ if(mx > tmp[idx]){ flg = true; }else{ mx = max(mx, tmp[idx]); } res *= 10; res += mx; } idx--; } return res; }; int T; cin >> T; while(T--){ ll n; cin >> n; // 桁和の最低値 ll mn = n + 1; while(!check2(mn)){ mn = update(mn + 1); } 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'; } }