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

int dig[51], cnt;
map<vector<int>, int> dp[51][2];
int dfs(vector<int> sta, int cur, int zero, int limit)
{
    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;
    }
    if (!limit && dp[cur][zero].count(sta))
        return dp[cur][zero][sta];
    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';
    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();
}