// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
// #define INTERACTIVE

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

namespace templates {
// type
using ll  = long long;
using ull = unsigned long long;
using Pii = pair<int, int>;
using Pil = pair<int, ll>;
using Pli = pair<ll, int>;
using Pll = pair<ll, ll>;
template <class T>
using pq = priority_queue<T>;
template <class T>
using qp = priority_queue<T, vector<T>, greater<T>>;
// clang-format off
#define vec(T, A, ...) vector<T> A(__VA_ARGS__);
#define vvec(T, A, h, ...) vector<vector<T>> A(h, vector<T>(__VA_ARGS__));
#define vvvec(T, A, h1, h2, ...) vector<vector<vector<T>>> A(h1, vector<vector<T>>(h2, vector<T>(__VA_ARGS__)));
// clang-format on

// for loop
#define fori1(a) for (ll _ = 0; _ < (a); _++)
#define fori2(i, a) for (ll i = 0; i < (a); i++)
#define fori3(i, a, b) for (ll i = (a); i < (b); i++)
#define fori4(i, a, b, c) for (ll i = (a); ((c) > 0 || i > (b)) && ((c) < 0 || i < (b)); i += (c))
#define overload4(a, b, c, d, e, ...) e
#define fori(...) overload4(__VA_ARGS__, fori4, fori3, fori2, fori1)(__VA_ARGS__)

// declare and input
// clang-format off
#define INT(...) int __VA_ARGS__; inp(__VA_ARGS__);
#define LL(...) ll __VA_ARGS__; inp(__VA_ARGS__);
#define STRING(...) string __VA_ARGS__; inp(__VA_ARGS__);
#define CHAR(...) char __VA_ARGS__; inp(__VA_ARGS__);
#define DOUBLE(...) double __VA_ARGS__; STRING(str___); __VA_ARGS__ = stod(str___);
#define VEC(T, A, n) vector<T> A(n); inp(A);
#define VVEC(T, A, n, m) vector<vector<T>> A(n, vector<T>(m)); inp(A);
// clang-format on

// const value
const ll MOD1   = 1000000007;
const ll MOD9   = 998244353;
const double PI = acos(-1);

// other macro
#if !defined(RIN__LOCAL) && !defined(INTERACTIVE)
#define endl "\n"
#endif
#define spa ' '
#define len(A) ll(A.size())
#define all(A) begin(A), end(A)

// function
vector<char> stoc(string &S) {
    int n = S.size();
    vector<char> ret(n);
    for (int i = 0; i < n; i++) ret[i] = S[i];
    return ret;
}
string ctos(vector<char> &S) {
    int n      = S.size();
    string ret = "";
    for (int i = 0; i < n; i++) ret += S[i];
    return ret;
}

template <class T>
auto min(const T &a) {
    return *min_element(all(a));
}
template <class T>
auto max(const T &a) {
    return *max_element(all(a));
}
template <class T, class S>
auto clamp(T &a, const S &l, const S &r) {
    return (a > r ? r : a < l ? l : a);
}
template <class T, class S>
inline bool chmax(T &a, const S &b) {
    return (a < b ? a = b, 1 : 0);
}
template <class T, class S>
inline bool chmin(T &a, const S &b) {
    return (a > b ? a = b, 1 : 0);
}
template <class T, class S>
inline bool chclamp(T &a, const S &l, const S &r) {
    auto b = clamp(a, l, r);
    return (a != b ? a = b, 1 : 0);
}

template <typename T>
T sum(vector<T> &A) {
    T tot = 0;
    for (auto a : A) tot += a;
    return tot;
}

template <typename T>
vector<T> compression(vector<T> X) {
    sort(all(X));
    X.erase(unique(all(X)), X.end());
    return X;
}

// input and output
namespace io {
// __int128_t
std::ostream &operator<<(std::ostream &dest, __int128_t value) {
    std::ostream::sentry s(dest);
    if (s) {
        __uint128_t tmp = value < 0 ? -value : value;
        char buffer[128];
        char *d = std::end(buffer);
        do {
            --d;
            *d = "0123456789"[tmp % 10];
            tmp /= 10;
        } while (tmp != 0);
        if (value < 0) {
            --d;
            *d = '-';
        }
        int len = std::end(buffer) - d;
        if (dest.rdbuf()->sputn(d, len) != len) {
            dest.setstate(std::ios_base::badbit);
        }
    }
    return dest;
}

// vector<T>
template <typename T>
istream &operator>>(istream &is, vector<T> &A) {
    for (auto &a : A) is >> a;
    return is;
}
template <typename T>
ostream &operator<<(ostream &os, vector<T> &A) {
    for (size_t i = 0; i < A.size(); i++) {
        os << A[i];
        if (i != A.size() - 1) os << ' ';
    }
    return os;
}

// vector<vector<T>>
template <typename T>
istream &operator>>(istream &is, vector<vector<T>> &A) {
    for (auto &a : A) is >> a;
    return is;
}
template <typename T>
ostream &operator<<(ostream &os, vector<vector<T>> &A) {
    for (size_t i = 0; i < A.size(); i++) {
        os << A[i];
        if (i != A.size() - 1) os << endl;
    }
    return os;
}

// pair<S, T>
template <typename S, typename T>
istream &operator>>(istream &is, pair<S, T> &A) {
    is >> A.first >> A.second;
    return is;
}
template <typename S, typename T>
ostream &operator<<(ostream &os, pair<S, T> &A) {
    os << A.first << ' ' << A.second;
    return os;
}

// vector<pair<S, T>>
template <typename S, typename T>
istream &operator>>(istream &is, vector<pair<S, T>> &A) {
    for (size_t i = 0; i < A.size(); i++) {
        is >> A[i];
    }
    return is;
}
template <typename S, typename T>
ostream &operator<<(ostream &os, vector<pair<S, T>> &A) {
    for (size_t i = 0; i < A.size(); i++) {
        os << A[i];
        if (i != A.size() - 1) os << endl;
    }
    return os;
}

// tuple
template <typename T, size_t N>
struct TuplePrint {
    static ostream &print(ostream &os, const T &t) {
        TuplePrint<T, N - 1>::print(os, t);
        os << ' ' << get<N - 1>(t);
        return os;
    }
};
template <typename T>
struct TuplePrint<T, 1> {
    static ostream &print(ostream &os, const T &t) {
        os << get<0>(t);
        return os;
    }
};
template <typename... Args>
ostream &operator<<(ostream &os, const tuple<Args...> &t) {
    TuplePrint<decltype(t), sizeof...(Args)>::print(os, t);
    return os;
}

// io functions
void FLUSH() {
    cout << flush;
}

void print() {
    cout << endl;
}
template <class Head, class... Tail>
void print(Head &&head, Tail &&...tail) {
    cout << head;
    if (sizeof...(Tail)) cout << spa;
    print(std::forward<Tail>(tail)...);
}

template <typename T, typename S>
void prisep(vector<T> &A, S sep) {
    int n = A.size();
    for (int i = 0; i < n; i++) {
        cout << A[i];
        if (i != n - 1) cout << sep;
    }
    cout << endl;
}
template <typename T, typename S>
void priend(T A, S end) {
    cout << A << end;
}
template <typename T>
void prispa(T A) {
    priend(A, spa);
}
template <typename T, typename S>
bool printif(bool f, T A, S B) {
    if (f)
        print(A);
    else
        print(B);
    return f;
}

template <class... T>
void inp(T &...a) {
    (cin >> ... >> a);
}

} // namespace io
using namespace io;

// read graph
vector<vector<int>> read_edges(int n, int m, bool direct = false, int indexed = 1) {
    vector<vector<int>> edges(n, vector<int>());
    for (int i = 0; i < m; i++) {
        INT(u, v);
        u -= indexed;
        v -= indexed;
        edges[u].push_back(v);
        if (!direct) edges[v].push_back(u);
    }
    return edges;
}
vector<vector<int>> read_tree(int n, int indexed = 1) {
    return read_edges(n, n - 1, false, indexed);
}

template <typename T = long long>
vector<vector<pair<int, T>>> read_wedges(int n, int m, bool direct = false, int indexed = 1) {
    vector<vector<pair<int, T>>> edges(n, vector<pair<int, T>>());
    for (int i = 0; i < m; i++) {
        INT(u, v);
        T w;
        inp(w);
        u -= indexed;
        v -= indexed;
        edges[u].push_back({v, w});
        if (!direct) edges[v].push_back({u, w});
    }
    return edges;
}
template <typename T = long long>
vector<vector<pair<int, T>>> read_wtree(int n, int indexed = 1) {
    return read_wedges<T>(n, n - 1, false, indexed);
}

// yes / no
namespace yesno {

// yes
inline bool yes(bool f = true) {
    cout << (f ? "yes" : "no") << endl;
    return f;
}
inline bool Yes(bool f = true) {
    cout << (f ? "Yes" : "No") << endl;
    return f;
}
inline bool YES(bool f = true) {
    cout << (f ? "YES" : "NO") << endl;
    return f;
}

// no
inline bool no(bool f = true) {
    cout << (!f ? "yes" : "no") << endl;
    return f;
}
inline bool No(bool f = true) {
    cout << (!f ? "Yes" : "No") << endl;
    return f;
}
inline bool NO(bool f = true) {
    cout << (!f ? "YES" : "NO") << endl;
    return f;
}

// possible
inline bool possible(bool f = true) {
    cout << (f ? "possible" : "impossible") << endl;
    return f;
}
inline bool Possible(bool f = true) {
    cout << (f ? "Possible" : "Impossible") << endl;
    return f;
}
inline bool POSSIBLE(bool f = true) {
    cout << (f ? "POSSIBLE" : "IMPOSSIBLE") << endl;
    return f;
}

// impossible
inline bool impossible(bool f = true) {
    cout << (!f ? "possible" : "impossible") << endl;
    return f;
}
inline bool Impossible(bool f = true) {
    cout << (!f ? "Possible" : "Impossible") << endl;
    return f;
}
inline bool IMPOSSIBLE(bool f = true) {
    cout << (!f ? "POSSIBLE" : "IMPOSSIBLE") << endl;
    return f;
}

// Alice Bob
inline bool Alice(bool f = true) {
    cout << (f ? "Alice" : "Bob") << endl;
    return f;
}
inline bool Bob(bool f = true) {
    cout << (f ? "Bob" : "Alice") << endl;
    return f;
}

// Takahashi Aoki
inline bool Takahashi(bool f = true) {
    cout << (f ? "Takahashi" : "Aoki") << endl;
    return f;
}
inline bool Aoki(bool f = true) {
    cout << (f ? "Aoki" : "Takahashi") << endl;
    return f;
}

} // namespace yesno
using namespace yesno;

} // namespace templates
using namespace templates;

template <int MOD>
struct Modint {
    int x;
    Modint() : x(0) {}
    Modint(int64_t y) {
        if (y >= 0)
            x = y % MOD;
        else
            x = (y % MOD + MOD) % MOD;
    }

    Modint &operator+=(const Modint &p) {
        x += p.x;
        if (x >= MOD) x -= MOD;
        return *this;
    }

    Modint &operator-=(const Modint &p) {
        x -= p.x;
        if (x < 0) x += MOD;
        return *this;
    }

    Modint &operator*=(const Modint &p) {
        x = int(1LL * x * p.x % MOD);
        return *this;
    }

    Modint &operator/=(const Modint &p) {
        *this *= p.inverse();
        return *this;
    }

    Modint &operator%=(const Modint &p) {
        assert(p.x == 0);
        return *this;
    }

    Modint operator-() const {
        return Modint(-x);
    }

    Modint &operator++() {
        x++;
        if (x == MOD) x = 0;
        return *this;
    }

    Modint &operator--() {
        if (x == 0) x = MOD;
        x--;
        return *this;
    }

    Modint operator++(int) {
        Modint result = *this;
        ++*this;
        return result;
    }

    Modint operator--(int) {
        Modint result = *this;
        --*this;
        return result;
    }

    friend Modint operator+(const Modint &lhs, const Modint &rhs) {
        return Modint(lhs) += rhs;
    }

    friend Modint operator-(const Modint &lhs, const Modint &rhs) {
        return Modint(lhs) -= rhs;
    }

    friend Modint operator*(const Modint &lhs, const Modint &rhs) {
        return Modint(lhs) *= rhs;
    }

    friend Modint operator/(const Modint &lhs, const Modint &rhs) {
        return Modint(lhs) /= rhs;
    }

    friend Modint operator%(const Modint &lhs, const Modint &rhs) {
        assert(rhs.x == 0);
        return Modint(lhs);
    }

    bool operator==(const Modint &p) const {
        return x == p.x;
    }

    bool operator!=(const Modint &p) const {
        return x != p.x;
    }

    bool operator<(const Modint &rhs) const {
        return x < rhs.x;
    }

    bool operator<=(const Modint &rhs) const {
        return x <= rhs.x;
    }

    bool operator>(const Modint &rhs) const {
        return x > rhs.x;
    }

    bool operator>=(const Modint &rhs) const {
        return x >= rhs.x;
    }

    Modint inverse() const {
        int a = x, b = MOD, u = 1, v = 0, t;
        while (b > 0) {
            t = a / b;
            a -= t * b;
            u -= t * v;
            std::swap(a, b);
            std::swap(u, v);
        }
        return Modint(u);
    }

    Modint pow(int64_t k) const {
        Modint ret(1);
        Modint y(x);
        while (k > 0) {
            if (k & 1) ret *= y;
            y *= y;
            k >>= 1;
        }
        return ret;
    }

    std::pair<int, int> to_frac(int max_n = 1000) const {
        int y = x;
        for (int i = 1; i <= max_n; i++) {
            if (y <= max_n) {
                return {y, i};
            } else if (MOD - y <= max_n) {
                return {-(MOD - y), i};
            }
            y = (y + x) % MOD;
        }
        return {-1, -1};
    }

    friend std::ostream &operator<<(std::ostream &os, const Modint &p) {
        return os << p.x;
    }

    friend std::istream &operator>>(std::istream &is, Modint &p) {
        int64_t y;
        is >> y;
        p = Modint<MOD>(y);
        return (is);
    }

    static int get_mod() {
        return MOD;
    }
};

struct Arbitrary_Modint {
    int x;
    static int MOD;

    static void set_mod(int mod) {
        MOD = mod;
    }

    Arbitrary_Modint() : x(0) {}
    Arbitrary_Modint(int64_t y) {
        if (y >= 0)
            x = y % MOD;
        else
            x = (y % MOD + MOD) % MOD;
    }

    Arbitrary_Modint &operator+=(const Arbitrary_Modint &p) {
        x += p.x;
        if (x >= MOD) x -= MOD;
        return *this;
    }

    Arbitrary_Modint &operator-=(const Arbitrary_Modint &p) {
        x -= p.x;
        if (x < 0) x += MOD;
        return *this;
    }

    Arbitrary_Modint &operator*=(const Arbitrary_Modint &p) {
        x = int(1LL * x * p.x % MOD);
        return *this;
    }

    Arbitrary_Modint &operator/=(const Arbitrary_Modint &p) {
        *this *= p.inverse();
        return *this;
    }

    Arbitrary_Modint &operator%=(const Arbitrary_Modint &p) {
        assert(p.x == 0);
        return *this;
    }

    Arbitrary_Modint operator-() const {
        return Arbitrary_Modint(-x);
    }

    Arbitrary_Modint &operator++() {
        x++;
        if (x == MOD) x = 0;
        return *this;
    }

    Arbitrary_Modint &operator--() {
        if (x == 0) x = MOD;
        x--;
        return *this;
    }

    Arbitrary_Modint operator++(int) {
        Arbitrary_Modint result = *this;
        ++*this;
        return result;
    }

    Arbitrary_Modint operator--(int) {
        Arbitrary_Modint result = *this;
        --*this;
        return result;
    }

    friend Arbitrary_Modint operator+(const Arbitrary_Modint &lhs, const Arbitrary_Modint &rhs) {
        return Arbitrary_Modint(lhs) += rhs;
    }

    friend Arbitrary_Modint operator-(const Arbitrary_Modint &lhs, const Arbitrary_Modint &rhs) {
        return Arbitrary_Modint(lhs) -= rhs;
    }

    friend Arbitrary_Modint operator*(const Arbitrary_Modint &lhs, const Arbitrary_Modint &rhs) {
        return Arbitrary_Modint(lhs) *= rhs;
    }

    friend Arbitrary_Modint operator/(const Arbitrary_Modint &lhs, const Arbitrary_Modint &rhs) {
        return Arbitrary_Modint(lhs) /= rhs;
    }

    friend Arbitrary_Modint operator%(const Arbitrary_Modint &lhs, const Arbitrary_Modint &rhs) {
        assert(rhs.x == 0);
        return Arbitrary_Modint(lhs);
    }

    bool operator==(const Arbitrary_Modint &p) const {
        return x == p.x;
    }

    bool operator!=(const Arbitrary_Modint &p) const {
        return x != p.x;
    }

    bool operator<(const Arbitrary_Modint &rhs) {
        return x < rhs.x;
    }

    bool operator<=(const Arbitrary_Modint &rhs) {
        return x <= rhs.x;
    }

    bool operator>(const Arbitrary_Modint &rhs) {
        return x > rhs.x;
    }

    bool operator>=(const Arbitrary_Modint &rhs) {
        return x >= rhs.x;
    }

    Arbitrary_Modint inverse() const {
        int a = x, b = MOD, u = 1, v = 0, t;
        while (b > 0) {
            t = a / b;
            a -= t * b;
            u -= t * v;
            std::swap(a, b);
            std::swap(u, v);
        }
        return Arbitrary_Modint(u);
    }

    Arbitrary_Modint pow(int64_t k) const {
        Arbitrary_Modint ret(1);
        Arbitrary_Modint y(x);
        while (k > 0) {
            if (k & 1) ret *= y;
            y *= y;
            k >>= 1;
        }
        return ret;
    }

    friend std::ostream &operator<<(std::ostream &os, const Arbitrary_Modint &p) {
        return os << p.x;
    }

    friend std::istream &operator>>(std::istream &is, Arbitrary_Modint &p) {
        int64_t y;
        is >> y;
        p = Arbitrary_Modint(y);
        return (is);
    }

    static int get_mod() {
        return MOD;
    }
};
int Arbitrary_Modint::MOD = 998244353;

using modint9 = Modint<998244353>;
using modint1 = Modint<1000000007>;
using modint  = Arbitrary_Modint;
using mint    = modint9;

void solve() {
    STRING(S);
    string T = "";
    fori(i, 1, 1010) {
        T += to_string(i);
    }

    auto match = [&](string S, string T) {
        assert(S.size() == T.size());
        fori(i, S.size()) {
            if (S[i] != T[i] and S[i] != '?') {
                return false;
            }
        }
        return true;
    };

    fori(i, len(T) - len(S) + 1) {
        if (match(S, T.substr(i, len(S)))) {
            print(i + 1);
            return;
        }
    }

    ll ma    = 1000;
    mint add = 9 + 180 + 2700;

    fori(d, 4, 30) {
        string T = "";
        fori(i, ma - 10, ma + 10) {
            T += to_string(i);
        }

        fori(i, len(T) - len(S) + 1) {
            if (match(S, T.substr(i, len(S)))) {
                mint ans = add + i - (d - 1) * 10 + 1;
                print(ans);
                return;
            }
        }

        auto f = [&](vector<string> &SS) -> ll {
            int n    = len(SS);
            auto dfs = [&](auto &&self, int d, int p) -> ll {
                if (p == -1) {
                    ll ret = 0;
                    fori(i, d + 1) {
                        ll x = -1;
                        for (auto &S : SS) {
                            if (S[i] == '?') continue;
                            if (x == -1) {
                                x = S[i] - '0';
                            } else if (x != S[i] - '0') {
                                return -1;
                            }
                        }
                        if (x == -1) {
                            x = (i == 0) ? 1 : 0;
                        }
                        if (i == 0 and x == 0) return -1;
                        ret = ret * 10 + x;
                    }
                    return ret;
                }
                if (d == -1) return -1;
                ll mi = 1LL << 60;

                fori(i, 9) {
                    bool ok = true;
                    fori(j, n) {
                        if (SS[j][d] == '?') continue;
                        int x = SS[j][d] - '0';
                        if (j < p and x == i) continue;
                        if (j >= p and x == i + 1) continue;
                        ok = false;
                        break;
                    }
                    if (ok) {
                        ll res = self(self, d - 1, -1);
                        if (res != -1) {
                            chmin(mi, res * 10 + i);
                        }
                    }
                }

                fori(j, n) {
                    if (SS[j][d] == '?') continue;
                    int x = SS[j][d] - '0';
                    if (j < p and x == 9) continue;
                    if (j >= p and x == 0) continue;
                    return mi == 1LL << 60 ? -1 : mi;
                }

                ll res = self(self, d - 1, p);
                if (res != -1) {
                    chmin(mi, res * 10 + 9);
                }
                if (mi != 1LL << 60)
                    return mi;
                else
                    return -1;
            };

            ll mi = 1LL << 60;
            fori(i, 10) {
                bool ok = true;
                int p   = -1;

                fori(j, n) {
                    if (i + j == 10) {
                        p = j;
                    }
                    if (SS[j][d - 1] == '?') {
                        continue;
                    } else if (SS[j][d - 1] - '0' != (i + j) % 10) {
                        ok = false;
                        break;
                    }
                }

                if (!ok) continue;

                ll ret = dfs(dfs, d - 2, p);
                if (ret != -1) {
                    chmin(mi, ret * 10 + i);
                }
            }

            if (mi != 1LL << 60) {
                return mi;
            }

            return -1;
        };

        mint ans_ = -1;
        ll mi     = 1LL << 60;
        fori(i, 1, d + 1) {
            vec(string, SS, 0);
            {
                string T = "";
                fori(d - i) {
                    T += '?';
                }
                T += S.substr(0, i);
                SS.push_back(T);
            }
            fori(j, i, len(S), d) {
                string T = S.substr(j, d);
                while (len(T) < d) {
                    T += '?';
                }
                SS.push_back(T);
            }

            auto res = f(SS);
            if (res != -1) {

                mint ans = add;
                ans += (res - ma) * d;
                ans += d - i + 1;
                if (chmin(mi, res)) {
                    ans_ = ans;
                }
            }
        }
        if (mi != 1LL << 60) {
            print(ans_);
            return;
        }

        add += mint(ma) * 9 * d;
        ma *= 10;
    }

    assert(false);
}

int main() {
#ifndef INTERACTIVE
    cin.tie(0)->sync_with_stdio(0);
#endif
    // cout << fixed << setprecision(12);
    int t;
    t = 1;
    cin >> t;
    while (t--) solve();
    return 0;
}

// // #pragma GCC target("avx2")
// // #pragma GCC optimize("O3")
// // #pragma GCC optimize("unroll-loops")
// // #define INTERACTIVE
//
// #include "kyopro-cpp/template.hpp"
//
// #include "misc/Modint.hpp"
// using mint = modint9;
//
// void solve() {
//     STRING(S);
//     string T = "";
//     fori(i, 1, 1010) {
//         T += to_string(i);
//     }
//
//     auto match = [&](string S, string T) {
//         assert(S.size() == T.size());
//         fori(i, S.size()) {
//             if (S[i] != T[i] and S[i] != '?') {
//                 return false;
//             }
//         }
//         return true;
//     };
//
//     fori(i, len(T) - len(S) + 1) {
//         if (match(S, T.substr(i, len(S)))) {
//             print(i + 1);
//             return;
//         }
//     }
//
//     ll ma    = 1000;
//     mint add = 9 + 180 + 2700;
//
//     fori(d, 4, 30) {
//         string T = "";
//         fori(i, ma - 10, ma + 10) {
//             T += to_string(i);
//         }
//
//         fori(i, len(T) - len(S) + 1) {
//             if (match(S, T.substr(i, len(S)))) {
//                 mint ans = add + i - (d - 1) * 10 + 1;
//                 print(ans);
//                 return;
//             }
//         }
//
//         auto f = [&](vector<string> &SS) -> ll {
//             int n    = len(SS);
//             auto dfs = [&](auto &&self, int d, int p) -> ll {
//                 if (p == -1) {
//                     ll ret = 0;
//                     fori(i, d + 1) {
//                         ll x = -1;
//                         for (auto &S : SS) {
//                             if (S[i] == '?') continue;
//                             if (x == -1) {
//                                 x = S[i] - '0';
//                             } else if (x != S[i] - '0') {
//                                 return -1;
//                             }
//                         }
//                         if (x == -1) {
//                             x = (i == 0) ? 1 : 0;
//                         }
//                         if (i == 0 and x == 0) return -1;
//                         ret = ret * 10 + x;
//                     }
//                     return ret;
//                 }
//                 if (d == -1) return -1;
//                 ll mi = 1LL << 60;
//
//                 fori(i, 9) {
//                     bool ok = true;
//                     fori(j, n) {
//                         if (SS[j][d] == '?') continue;
//                         int x = SS[j][d] - '0';
//                         if (j < p and x == i) continue;
//                         if (j >= p and x == i + 1) continue;
//                         ok = false;
//                         break;
//                     }
//                     if (ok) {
//                         ll res = self(self, d - 1, -1);
//                         if (res != -1) {
//                             chmin(mi, res * 10 + i);
//                         }
//                     }
//                 }
//
//                 fori(j, n) {
//                     if (SS[j][d] == '?') continue;
//                     int x = SS[j][d] - '0';
//                     if (j < p and x == 9) continue;
//                     if (j >= p and x == 0) continue;
//                     return mi == 1LL << 60 ? -1 : mi;
//                 }
//
//                 ll res = self(self, d - 1, p);
//                 if (res != -1) {
//                     chmin(mi, res * 10 + 9);
//                 }
//                 if (mi != 1LL << 60)
//                     return mi;
//                 else
//                     return -1;
//             };
//
//             ll mi = 1LL << 60;
//             fori(i, 10) {
//                 bool ok = true;
//                 int p   = -1;
//
//                 fori(j, n) {
//                     if (i + j == 10) {
//                         p = j;
//                     }
//                     if (SS[j][d - 1] == '?') {
//                         continue;
//                     } else if (SS[j][d - 1] - '0' != (i + j) % 10) {
//                         ok = false;
//                         break;
//                     }
//                 }
//
//                 if (!ok) continue;
//
//                 ll ret = dfs(dfs, d - 2, p);
//                 if (ret != -1) {
//                     chmin(mi, ret * 10 + i);
//                 }
//             }
//
//             if (mi != 1LL << 60) {
//                 return mi;
//             }
//
//             return -1;
//         };
//
//         mint ans_ = -1;
//         ll mi     = 1LL << 60;
//         fori(i, 1, d + 1) {
//             vec(string, SS, 0);
//             {
//                 string T = "";
//                 fori(d - i) {
//                     T += '?';
//                 }
//                 T += S.substr(0, i);
//                 SS.push_back(T);
//             }
//             fori(j, i, len(S), d) {
//                 string T = S.substr(j, d);
//                 while (len(T) < d) {
//                     T += '?';
//                 }
//                 SS.push_back(T);
//             }
//
//             auto res = f(SS);
//             if (res != -1) {
//
//                 mint ans = add;
//                 ans += (res - ma) * d;
//                 ans += d - i + 1;
//                 if (chmin(mi, res)) {
//                     ans_ = ans;
//                 }
//             }
//         }
//         if (mi != 1LL << 60) {
//             print(ans_);
//             return;
//         }
//
//         add += mint(ma) * 9 * d;
//         ma *= 10;
//     }
//
//     assert(false);
// }
//
// int main() {
// #ifndef INTERACTIVE
//     cin.tie(0)->sync_with_stdio(0);
// #endif
//     // cout << fixed << setprecision(12);
//     int t;
//     t = 1;
//     cin >> t;
//     while (t--) solve();
//     return 0;
// }