#include <bits/stdc++.h>

using namespace std;
#define ll long long
#define pii pair<int, int>
#define ld long double
#define all(a) (a).begin(), (a).end()

const int MOD = 1e9 + 7;

int add(int a, int b) {
    if (a + b < MOD)
        return a + b;
    return a + b - MOD;
}

int sub(int a, int b) {
    if (a >= b)
        return a - b;
    return a + MOD - b;
}


int mul(int a, int b) {
    return a * 1ll * b % MOD;
}

int pw(int a, int n) {
    int ans = 1;
    while (n) {
        if (n & 1)
            ans = mul(ans, a);
        a = mul(a, a);
        n >>= 1;
    }
    return ans;
}

const int MAXN = 55;
int C[MAXN][MAXN];

int get_cnt(int k, vector<int> mx_cnt) {
    vector<int> dp(k + 1, 0);
    vector<int> new_dp(k + 1, 0);
    dp[0] = 1;
    for (int x : mx_cnt) {
        fill(new_dp.begin(), new_dp.end(), 0);
        for (int j = 0; j <= x; ++j) {
            for (int i = 0; i + j <= k; ++i)
                new_dp[i + j] = add(new_dp[i + j], mul(dp[i], C[i + j][j]));
        }
        swap(dp, new_dp);
    }
    return dp[k];
}

int get_ans(int len, vector<int> cur_cnt) {
    int ans = 0;
    for (int mx = 0; mx < 10; ++mx) {
        for (int has_mx = cur_cnt[mx]; has_mx <= cur_cnt[mx] + len; ++has_mx) {
            bool ok = true;
            for (int i = 0; i < 10; ++i) {
                if (cur_cnt[i] > has_mx || (cur_cnt[i] == has_mx && i > mx)) {
                    ok = false;
                    break;
                }
            }
            if (ok) {
                vector<int> a(10);
                for (int i = 0; i < mx; ++i)
                    a[i] = has_mx - cur_cnt[i];
                for (int i = mx + 1; i < 10; ++i)
                    a[i] = has_mx  - cur_cnt[i] - 1;
                ans = add(ans, mul(mul(mx, C[len][has_mx - cur_cnt[mx]]), get_cnt(len - (has_mx - cur_cnt[mx]), a)));
            }
        }
    }
    return ans;
}

void solve() {
    string s;

    cin >> s;
    int ans = 0;
    for (int i = 1; i < s.size(); ++i) {
        // up to i are zeroes
        for (int j = 1; j < 10; ++j) {
            vector<int> cur_cnt(10);
            cur_cnt[j] = 1;
            ans = add(ans, get_ans(s.size() - i - 1, cur_cnt));
        }
    }
    vector<int> cur_cnt(10);
    for (int i = 0; i < s.size(); ++i) {
        for (int j = i == 0 ? 1 : 0; j < int(s[i] - '0'); ++j) {
            ++cur_cnt[j];
            ans = add(ans, get_ans(s.size() - i - 1, cur_cnt));
            --cur_cnt[j];
        }
        ++cur_cnt[s[i] - '0'];
    }
    ans = add(ans, get_ans(0, cur_cnt));
    cout << ans << '\n';
}


signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    C[0][0] = 1;
    for (int n = 1; n < MAXN; ++n) {
        C[n][0] = 1;
        for (int k = 1; k <= n; ++k) {
            C[n][k] = add(C[n - 1][k - 1], C[n - 1][k]);
        }
    }

    int t;
    cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}