#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using mint = modint998244353;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int tt;
  cin >> tt;
  int memo[1001];
  rrep(i, 1001) {
    string s = to_string(i);
    bool ok = false;
    rep(p, ssize(s) - 2) {
      if (s[p] - '0' > (s[p+1] - '0') + (s[p+2] - '0')) ok = true;
    }
    memo[i] = ok ? i : memo[i+1];
  }
  while (tt--) {
    string n;
    cin >> n;
    mint dp[10][10][10][2];
    dp[0][0][0][0] = 1;
    mint nn;
    for (char c : n) {
      mint ndp[10][10][10][2];
      int x = c - '0';
      nn = 10 * nn + x;
      rep(i, 10) rep(j, 10) rep(k, 10) rep(lt, 2) if (mint val = dp[i][j][k][lt]; val.val()) {
        rep(d, 10) if (j <= k + d) {
          if (!lt && d > x) continue;
          ndp[j][k][d][lt | (d < x)] += val;
        }
      }
      swap(dp, ndp);
    }
    dp[0][0][0][1]--;
    mint ans = nn * (nn + 1) / 2;
    rep(i, 10) rep(j, 10) rep(k, 10) rep(lt, 2) {
      int v = 100 * i + 10 * j + k;
      ans += (memo[v] - v) * dp[i][j][k][lt];
    }
    cout << ans.val() << '\n';
  }
}