#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++) {
        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++) {
            for (int now = 0; now <= min(mx - cnt[i], lst); now++) {
                if (i > c && now == mx - cnt[i]) continue;
                if (i == c && now != mx - cnt[i]) continue;
                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;
            //if (c == 1) cout << answer << endl;
        }
    }
    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;
    }
    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]--;
            }
        }
        //cnt[1] = 1;
        //cout << "OK" << endl;
        //cout << get(1) << endl;
        //exit(0);
        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;
                    //cout << i << " " << j << " " << ans << endl;
                    //if (i == 1 && j == 2) exit(0);
                }
                cnt[j]--;
            }
            cnt[s[i] - '0']++;
        }
        ans = (ans + get(0)) % mod;
        cout << ans << '\n';
    }
    return 0;
}