#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define N 100005
#define mod 1'000'000'007

int dig[51], cnt;
int table[51] = {0, 45, 615, 6570, 63657,
                 597600, 5689830, 56017680, 564676515,
                 706253855, 53001921, 116607642, 807754616,
                 555253686, 93648429, 358785453, 214810078,
                 642432049, 158594480, 599067452, 311948107,
                 103373398, 86116420, 524897403, 907977314,
                 138576683, 44283636, 241998094, 583822532,
                 537947530, 636674358, 585550280, 414900917,
                 756538572, 442412153, 703712200, 837470764,
                 311869987, 733194120, 596841112, 387537647,
                 769854984, 977490984, 112225690, 117109110,
                 439421821, 374895741, 471922812, 10030060,
                 835556902, 25251932};
map<vector<int>, int> dp[51][2];
int dfs(vector<int> sta, int cur, int zero, int limit)
{
    if (zero && !limit)
        return table[cur];
    if (!limit && dp[cur][zero].count(sta))
        return dp[cur][zero][sta];
    if (!cur)
    {
        int mx = *max_element(sta.begin(), sta.end()), ans = 0;
        for (int i = 0; i <= 9; i++)
            if (mx && sta[i] == mx)
                ans = i;
        if (!limit)
            dp[cur][zero][sta] = ans;
        return ans;
    }
    int res = 0;
    for (int i = 0; i <= (limit ? dig[cur] : 9); i++)
    {
        if (!zero || i)
            sta[i]++;
        res = (res + dfs(sta, cur - 1, zero && (i == 0), limit && (i == dig[cur]))) % mod;
        if (!zero || i)
            sta[i]--;
    }
    if (!limit)
        dp[cur][zero][sta] = res;
    return res;
}
void solve()
{
    string s;
    cin >> s;
    cnt = 0;
    for (char c : s)
        dig[++cnt] = c - '0';
    reverse(dig + 1, dig + cnt + 1);
    cout << dfs(vector<int>(10, 0), cnt, 1, 1) << '\n';
}

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    cin >> t;
    while (t--)
        solve();
}