#include <bits/stdc++.h>
#define fr first
#define sc second
#define all(a) (a).begin(), (a).end()
#define unique(a) a.resize(unique(a.begin(), a.end()) - a.begin())

using namespace std;

#ifdef ONPC
mt19937 rnd(223);
#else
mt19937 rnd(chrono::high_resolution_clock::now()
			.time_since_epoch().count());
#endif

#define TIME (clock() * 1.0 / CLOCKS_PER_SEC)

using ll = long long;
using ld = double;

using uint = unsigned int;
using ull = unsigned long long;
template <uint MD> struct ModInt {
    using M = ModInt;
    uint v;
    ModInt(ll _v = 0) { set_v(uint(_v % MD + MD)); }
    M& set_v(uint _v) {
        v = (_v < MD) ? _v : _v - MD;
        return *this;
    }
    explicit operator bool() const { return v != 0; }
    M operator-() const { return M() - *this; }
    M operator+(const M& r) const { return M().set_v(v + r.v); }
    M operator-(const M& r) const { return M().set_v(v + MD - r.v); }
    M operator*(const M& r) const { return M().set_v(uint((ull)v * r.v % MD)); }
    M operator/(const M& r) const { return *this * r.inv(); }
    M& operator+=(const M& r) { return *this = *this + r; }
    M& operator-=(const M& r) { return *this = *this - r; }
    M& operator*=(const M& r) { return *this = *this * r; }
    M& operator/=(const M& r) { return *this = *this / r; }
    bool operator==(const M& r) const { return v == r.v; }
    bool operator!=(const M& r) const { return v != r.v; }
    M inv() const;
    friend istream& operator>>(istream& is, M& r) { ll x; is >> x; r = M(x); return is; }
    friend ostream& operator<<(ostream& os, const M& r) { return os << r.v; }
};

template<uint MD>
ModInt<MD> pow(ModInt<MD> x, ll n) {
    ModInt<MD> r = 1;
    while (n) {
        if (n & 1) r *= x;
        x *= x;
        n >>= 1;
    }
    return r;
}

template<uint MD>
ModInt<MD> ModInt<MD>::inv() const { return pow(*this, MD - 2); }

using Mint = ModInt<int(1e9 + 7)>;
// using Mint = double;

const int maxn = 1e5 + 100, inf = 1e9 + 100;

using V = array<int, 10>;

Mint dp[11][52][52], pd[11][52][52];

Mint of[52], f[52];

void calc(V ap, int k, int real_mx) {
    memset(dp, 0, sizeof(dp));
    dp[0][0][0] = 1;
    int mx = k + real_mx;
    for (int i = 1; i < 10; i++) {
        for (int j = 0; j <= k; j++)
            fill(dp[i][j], dp[i][j] + k + 1, 0);
        for (int s = 0; s <= k; s++)
            for (int m = 0; m <= mx; m++)
                if (dp[i - 1][s][m] != 0) {
                    Mint val = dp[i - 1][s][m];
                    for (int z = 0; z + s <= k; z++) {
                        dp[i][s + z][max(m, z + ap[i - 1])] += val * of[z];
                    }
                }
    }
    for (int i = 0; i < 10; i++)
        for (int j = 0; j <= k; j++)
            for (int z = 0; z < mx; z++)
                dp[i][j][z + 1] += dp[i][j][z];
}

Mint go(V ap, int k) {
//    cerr << "call ";
//    for (int i : ap)
//        cerr << i << ' ';
//    cerr << "k " << k << '\n';
    int real_mx = 0;
    for (int i : ap)
        real_mx = max(real_mx, i);
    reverse(all(ap));
    calc(ap, k, real_mx);
    swap(dp, pd);
    reverse(all(ap));
    calc(ap, k, real_mx);
    Mint ans = 0;
    for (int m = 0; m < 10; m++) {
        for (int v = 0; v <= k; v++) {
            for (int le = 0; le + v <= k; le++) {
                ans += Mint(m) * of[v] * dp[m][le][ap[m] + v] * pd[9 - m][k - le - v][ap[m] + v - 1];
            }
        }
    }
    ans *= f[k];
    return ans;
}

void solve() {
    Mint ans = 0;
    string s(50, '9');
    cin >> s;
    for (char &c : s)
        c -= 48;
    int n = s.size();
    f[0] = of[0] = 1;
    for (int i = 1; i <= n; i++) {
        f[i] = f[i - 1] * i;
        of[i] = Mint(1) / f[i];
    }
    for (int len = 1; len < n; len++) {
        for (int w = 1; w < 10; w++) {
            V ap{};
            ap[w]++;
            ans += go(ap, len - 1);
        }
    }
    for (int i = 0; i < n; i++) {
        for (int w = (i == 0); w < s[i] + (i + 1 == n); w++) {
            V ap{};
            for (int j = 0; j < i; j++)
                ap[s[j]]++;
            ap[w]++;
            Mint vs = go(ap, n - i - 1);
//            cerr << "w " << w << ' ' << vs << '\n';
            ans += vs;
        }
    }
    cout << ans << '\n';
}

int main() {
#ifdef ONPC
    freopen("../a.in", "r", stdin);
//    freopen("../a.out", "w", stdout);
#endif
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout << fixed;
    cout.precision(20);
    int ts;
    cin >> ts;
    while (ts--)
        solve();
    cerr << "\n\nConsumed " << TIME << endl;
}