#include <bits/stdc++.h>

using i64 = long long;

template<class T>
constexpr T power(T a, i64 b) {
    T res {1};
    for (; b; b /= 2, a *= a) {
        if (b % 2) {
            res *= a;
        }
    }
    return res;
}

constexpr i64 mul(i64 a, i64 b, i64 p) {
    i64 res = a * b - i64(1.L * a * b / p) * p;
    res %= p;
    if (res < 0) {
        res += p;
    }
    return res;
}

template<i64 P>
struct MInt {
    i64 x;
    constexpr MInt() : x {0} {}
    constexpr MInt(i64 x) : x {norm(x % getMod())} {}
    
    static i64 Mod;
    constexpr static i64 getMod() {
        if (P > 0) {
            return P;
        } else {
            return Mod;
        }
    }
    constexpr static void setMod(i64 Mod_) {
        Mod = Mod_;
    }
    constexpr i64 norm(i64 x) const {
        if (x < 0) {
            x += getMod();
        }
        if (x >= getMod()) {
            x -= getMod();
        }
        return x;
    }
    constexpr i64 val() const {
        return x;
    }
    constexpr MInt operator-() const {
        MInt res;
        res.x = norm(getMod() - x);
        return res;
    }
    constexpr MInt inv() const {
        return power(*this, getMod() - 2);
    }
    constexpr MInt &operator*=(MInt rhs) & {
        if (getMod() < (1ULL << 31)) {
            x = x * rhs.x % int(getMod());
        } else {
            x = mul(x, rhs.x, getMod());
        }
        return *this;
    }
    constexpr MInt &operator+=(MInt rhs) & {
        x = norm(x + rhs.x);
        return *this;
    }
    constexpr MInt &operator-=(MInt rhs) & {
        x = norm(x - rhs.x);
        return *this;
    }
    constexpr MInt &operator/=(MInt rhs) & {
        return *this *= rhs.inv();
    }
    friend constexpr MInt operator*(MInt lhs, MInt rhs) {
        MInt res = lhs;
        res *= rhs;
        return res;
    }
    friend constexpr MInt operator+(MInt lhs, MInt rhs) {
        MInt res = lhs;
        res += rhs;
        return res;
    }
    friend constexpr MInt operator-(MInt lhs, MInt rhs) {
        MInt res = lhs;
        res -= rhs;
        return res;
    }
    friend constexpr MInt operator/(MInt lhs, MInt rhs) {
        MInt res = lhs;
        res /= rhs;
        return res;
    }
    friend constexpr std::istream &operator>>(std::istream &is, MInt &a) {
        i64 v;
        is >> v;
        a = MInt(v);
        return is;
    }
    friend constexpr std::ostream &operator<<(std::ostream &os, const MInt &a) {
        return os << a.val();
    }
    friend constexpr bool operator==(MInt lhs, MInt rhs) {
        return lhs.val() == rhs.val();
    }
    friend constexpr bool operator!=(MInt lhs, MInt rhs) {
        return lhs.val() != rhs.val();
    }
};

template<>
i64 MInt<0>::Mod = 998244353;

constexpr int P = 1000000007;
using Z = MInt<P>;

struct Comb {
    int n;
    std::vector<Z> _fac;
    std::vector<Z> _invfac;
    std::vector<Z> _inv;
    
    Comb() : n{0}, _fac{1}, _invfac{1}, _inv{0} {}
    Comb(int n) : Comb() {
        init(n);
    }
    
    void init(int m) {
        if (m <= n) return;
        _fac.resize(m + 1);
        _invfac.resize(m + 1);
        _inv.resize(m + 1);
        
        for (int i = n + 1; i <= m; i++) {
            _fac[i] = _fac[i - 1] * i;
        }
        _invfac[m] = _fac[m].inv();
        for (int i = m; i > n; i--) {
            _invfac[i - 1] = _invfac[i] * i;
            _inv[i] = _invfac[i] * _fac[i - 1];
        }
        n = m;
    }
    
    Z fac(int m) {
        if (m > n) init(2 * m);
        return _fac[m];
    }
    Z invfac(int m) {
        if (m > n) init(2 * m);
        return _invfac[m];
    }
    Z inv(int m) {
        if (m > n) init(2 * m);
        return _inv[m];
    }
    Z binom(int n, int m) {
        if (n < m || m < 0) return 0;
        return fac(n) * invfac(m) * invfac(n - m);
    }
} comb;


void solve() {
    std::string s;
    std::cin >> s;
    
    int n = s.size();
    
    std::vector binom(n + 1, std::vector<Z>(n + 1));
    for (int i = 0; i <= n; i++) {
        for (int j = 0; j <= i; j++) {
            binom[i][j] = comb.binom(i, j);
        }
    }
    
    Z ans = 0;
    
    for (int mode = 0; mode < 10; mode++) {
        for (int cnt = 1; cnt <= n; cnt++) {
            std::vector<int> freq(10);
            for (int i = 1; i < n; i++) {
                int res = n - (i + 1);
                int lo = 1;
                int hi = 9;
                std::vector dp(res + 1, std::array<Z, 2>{});
                dp[0][0] = 1;
                for (int c = 0; c < 10; c++) {
                    for (int sum = res; sum >= 0; sum--) {
                        int lim = (c <= mode ? cnt : cnt - 1);
                        for (int t = 1; t >= 0; t--) {
                            Z val = dp[sum][t];
                            dp[sum][t] = 0;
                            for (int i = 0; i <= lim && i + sum <= res; i++) {
                                for (int j = 0; j + t <= 1 && i + j <= lim; j++) {
                                    if (i + j < lim && c == mode) {
                                        continue;
                                    }
                                    if (j && (c < lo || c > hi)) {
                                        continue;
                                    }
                                    dp[sum + i][t + j] += val * binom[sum + i][i];
                                }
                            }
                        }
                    }
                }
                ans += dp[res][1] * mode;
            }
            for (int i = 0; i < n; i++) {
                int res = n - (i + 1);
                int lo = (i == 0 ? 1 : 0);
                int hi = s[i] - '0' - 1;
                std::vector dp(res + 1, std::array<Z, 2>{});
                dp[0][0] = 1;
                for (int c = 0; c < 10; c++) {
                    for (int sum = res; sum >= 0; sum--) {
                        int lim = (c <= mode ? cnt : cnt - 1) - freq[c];
                        for (int t = 1; t >= 0; t--) {
                            Z val = dp[sum][t];
                            dp[sum][t] = 0;
                            for (int i = 0; i <= lim && i + sum <= res; i++) {
                                for (int j = 0; j + t <= 1 && i + j <= lim; j++) {
                                    if (i + j < lim && c == mode) {
                                        continue;
                                    }
                                    if (j && (c < lo || c > hi)) {
                                        continue;
                                    }
                                    dp[sum + i][t + j] += val * binom[sum + i][i];
                                }
                            }
                        }
                    }
                }
                ans += dp[res][1] * mode;
                freq[s[i] - '0']++;
            }
        }
    }
    
    std::vector<int> freq(10);
    for (auto c : s) {
        freq[c - '0']++;
    }
    int mode = 0;
    for (int i = 0; i < 10; i++) {
        if (freq[i] >= freq[mode]) {
            mode = i;
        }
    }
    ans += mode;
    
    std::cout << ans << "\n";
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    
    int t;
    std::cin >> t;
    
    while (t--) {
        solve();
    }
    
    return 0;
}