#include <bits/stdc++.h>

using namespace std;

const int N = 65, P = 1e9 + 7;

int fac[N], iFac[N], f[N], g[N];

int calc(int c1, vector<int> c2, int n) {
    if (*min_element(c2.begin(), c2.end()) < 0 || c1 > n) return 0;
    if (c1 + accumulate(c2.begin(), c2.end(), 0) < n) return 0;
    for (int i = 0; i <= n; ++i) f[i] = (i == c1 ? iFac[i] : 0);
    for (auto x : c2) {
        for (int i = 0; i <= n; ++i) g[i] = f[i], f[i] = 0;
        for (int i = 0; i <= n; ++i) {
            for (int j = 0; j <= x && j <= n - i; ++j) {
                f[i + j] = (f[i + j] + 1ll * g[i] * iFac[j]) % P;
            }
        }
    }
    return 1ll * f[n] * fac[n] % P;
}

long long pre[N];

signed main() {
    for (int i = fac[0] = 1; i <= 55; ++i) {
        fac[i] = 1ll * fac[i - 1] * i % P;
        iFac[i] = (i == 1 ? 1 : 1ll * (P - P / i) * iFac[P % i] % P);
    }
    for (int i = iFac[0] = 1; i <= 55; ++i) {
        iFac[i] = 1ll * iFac[i - 1] * iFac[i] % P;
    }
    for (int i = 1; i <= 55; ++i) {
        for (int j = 1; j <= 9; ++j) {
            for (int k = 1; k <= i; ++k) {
                vector<int> ts;
                for (int l = 0; l < 10; ++l) {
                    if (l != j) ts.push_back(k - (l > j));
                }
                pre[i] += 1ll * j * calc(k, ts, i);
                --ts[0], pre[i] -= 1ll * j * calc(k, ts, i - 1);
            }
        }
        pre[i] += pre[i - 1];
    }
    int T; scanf("%d", &T);
    while (T--) {
        string S; cin >> S;
        map<char, int> M;
        for (auto x : S) ++M[x];
        pair<int, int> mx = {0, 0};
        for (auto [x, y] : M) mx = max(mx, {y, x - '0'});
        int n = S.size();
        long long res = mx.second + pre[S.size() - 1];
        int ct[10];
        for (int i = 0; i < 10; ++i) ct[i] = 0;
        for (int i = 0; i <= n - 1; ++i) {
            for (int j = !i; j < S[i] - '0'; ++j) {
                for (int k = 1; k < 10; ++k) {
                    for (int l = 0; l <= n - i - 1; ++l) {
                        vector<int> ts;
                        for (int p = 0; p < 10; ++p) {
                            if (p != k) ts.push_back(ct[k] + (j == k) + l - ct[p] - (j == p) - (p > k));
                        }
                        res += 1ll * k * calc(l, ts, n - i - 1);
                    }
                }
            }
            ++ct[S[i] - '0'];
        }
        printf("%lld\n", (res % P + P) % P);
    }
    return 0;
}