#include <bits/stdc++.h>

using namespace std;

signed main() {
    int Te; scanf("%d", &Te);
    string I;
    for (int i = 1; i <= 110; ++i) I += to_string(i);
    while (Te--) {
        string S; cin >> S;
        __uint128_t res = -1;
        for (__uint128_t i = 0; i + S.size() < I.size(); ++i) {
            int flg = 1;
            for (int j = 0; flg && j < S.size(); flg &= (S[j] == '?' || S[j] == I[j + i]), ++j);
            if (flg) res = min(res, i + 1);
        }
        for (int L = 3; L <= S.size() + 1; ++L)
        for (int o = 1; o <= L; ++o)
        for (int p = 0; p < 10; ++p)
        for (int q = 0; q < L; ++q) {
            vector<int> T(L, -1); T.back() = p;
            for (int i = 2; i <= q + 1; ++i) T.end()[-i] = 9;
            int flg = 1;
            for (int i = 0, x = 0, y = o; i < S.size() && flg; ++i, --y) {
                if (!y) ++x, y = L + (p + x >= 10 && q + 1 == L);
                if (S[i] == '?') continue;
                int v = S[i] - '0';
                if (y == 1) v = (v - x + 10) % 10;
                else if (p + x >= 10 && y <= q + 2) v = (v + 9) % 10;
                if (y > L) flg &= (!v);
                else if (~T.end()[-y] && T.end()[-y] != v) flg = 0;
                else T.end()[-y] = v;
            }
            if (!flg || T[0] == '0' || (q + 1 != L && T.end()[-(q + 2)] == '9')) continue;
            for (int i = 0; i < L; ++i) if (T[i] == -1) T[i] = !i;
            __uint128_t S = L;
            for (__uint128_t i = 1, t = 9; i < L; ++i, t *= 10) S += i * t;
            for (__uint128_t i = L - 1, t = 1; ~i; --i, t *= 10) S += L * (T[i] - !i) * t;
            res = min(res, S - o + 1);
        }
        printf("%d\n", (int)(res % 998244353));
    }
    return 0;
}