#include<bits/stdc++.h>

using namespace std;

typedef long long ll;
int const maxn = 55;
int mod = 1e9 + 7;
int C[maxn][maxn], cnt[10];
ll dp[maxn][maxn];

ll solve(int n, int c, int mx) {
    for (int i = 0; i <= 10; i++) {
        if (i < 10 && cnt[i] > mx) return 0;
        for (int j = 0; j < maxn; j++) dp[i][j] = 0;
    }
    dp[0][n] = 1;
    for (int i = 0; i <= 9; i++) {
        for (int lst = 0; lst <= n; lst++) {
            if (!dp[i][lst]) continue;
            int l = 0, r = min(mx - cnt[i], lst);
            if (i == c) l = mx - cnt[i];
            else if (i > c) r = min(r, mx - cnt[i] - 1);
            for (int now = l; now <= r; now++) {
                dp[i + 1][lst - now] = (dp[i + 1][lst - now] + dp[i][lst] * C[lst][now]) % mod;
            }
        }
    }
    return dp[10][0];
}

int get(int n) {
    ll answer = 0;
    for (int c = 0; c <= 9; c++) {
        for (int cur = cnt[c]; cur <= cnt[c] + n; cur++) {
            answer = (answer + (ll)c * solve(n, c, cur)) % mod;
        }
    }
    return answer;
}

main() {
#ifdef HOME
    freopen("input.txt", "r", stdin);
#endif // HOME
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t;
    cin >> t;
    for (int i = 0; i < maxn; i++) C[i][0] = 1;
    for (int i = 1; i < maxn; i++) {
        for (int j = 1; j <= i; j++) C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % mod;
    }
    vector < ll > calc = {0, 45, 570, 5955, 57087, 533943, 5092230, 50327850, 508658835, 141577340, 346748073, 63605721, 691146974, 747499077, 538394750, 265137024, 856024632, 427621971, 516162438, 440472972, 712880662, 791425298, 982743029, 438780983, 383079911, 230599376, 905706960, 197714458, 341824438, 954125005, 98726828, 948875929, 829350644, 341637655, 685873588, 261300047, 133758564, 474399230, 421324133, 863646999, 790696542, 382317337, 207636000, 134734713, 4883420, 322312711, 935473927, 97027071, 538107255, 825526842, 189695037};
    while (t--) {
        string s;
        cin >> s;
        int ans = 0;
        for (int i = 0; i < 10; i++) cnt[i] = 0;
        for (int len = 1; len < s.size(); len++) {
            /*for (int c = 1; c <= 9; c++) {
                cnt[c]++;
                ans = (ans + get(len - 1)) % mod;
                cnt[c]--;
            }*/
            ans = (ans + calc[len]) % mod;
        }
        for (int i = 0; i < s.size(); i++) {
            for (int j = 0; j < s[i] - '0'; j++) {
                cnt[j]++;
                if (i || j) {
                    ans = (ans + get(s.size() - i - 1)) % mod;
                }
                cnt[j]--;
            }
            cnt[s[i] - '0']++;
        }
        ans = (ans + get(0)) % mod;
        cout << ans << '\n';
    }
    return 0;
}