#include <bits/stdc++.h>
using namespace std;
using LL = long long;
using pll = pair<LL, LL>;
using pii = pair<LL, LL>;
const int N = 51, K = 10;
const LL mod = 1e9 + 7;
using Ti = int;
Ti freq[K];
Ti limits[K];
Ti invf[N];
Ti f[N];
Ti C(Ti n, Ti k){
    return (LL)f[n] * invf[k] % mod * invf[n - k] % mod;
}
Ti a[N], b[N], c[N];

void multiply(Ti l1, Ti l2, Ti n){
    memset(c, 0, sizeof c);
    for(Ti i = 0; i <= l1 && i <= n; i++){
        for(Ti j = 0; j <= l2 && i + j <= n; j++){
            c[i + j] = (c[i + j] + (LL)a[i] * b[j]) % mod;
        }
    }
}
Ti calc(Ti n){
    memset(a, 0, sizeof a);
    a[0] = 1;
    Ti cur = 0;
    for(Ti i = 0; i < K; i++){
        if(limits[i] == 0)continue;
        if(limits[i] < 0)return 0;
        for(Ti j = 0; j <= limits[i]; j++)b[j] = invf[j];
        multiply(cur, limits[i], n);
        cur = min(cur + limits[i], n);
        for(Ti j = 0; j <= cur; j++)a[j] = c[j];
    }
    return (LL)a[n] * f[n] % mod;
}

Ti solve(Ti n){
    Ti ans = 0;
    for(Ti mode = 1; mode < K; mode++){
        for(Ti cnt = 0; cnt <= n; cnt++){
            for(Ti j = 0; j < K; j++){
                limits[j] = cnt + freq[mode] - freq[j] - (j > mode);
            }
            limits[mode] = 0;
//            cout << n - cnt << " " << calc(n - cnt) << endl;
            ans = (ans + (LL)calc(n - cnt) * mode % mod * C(n, cnt)) % mod;

        }
//        cout << ans << "\n";
    }
    return ans;
}

void testcase(Ti cs){
    string s;
    cin >> s;
    Ti n = s.size();
    memset(freq, 0, sizeof freq);
    Ti ans = 0;
    //0 er hishab

    for(Ti i = 1; i < n; i++){
        for(Ti j = 1; j < K; j++){
            freq[j] = 1;
            ans = (ans + solve(n - i - 1)) % mod;
            freq[j] = 0;
        }
    }

//    cout << solve(1) << endl;
    //onno part
    for(Ti i = 0; i < n; i++){
        for(Ti j = (i == 0 ? 1 : 0); j < s[i] - '0'; j++){
            freq[j]++;
            ans = (ans + solve(n - i - 1)) % mod;
            freq[j]--;
        }
        freq[s[i] - '0']++;
    }


    Ti t = 0;
    for(Ti i = 0; i < K; i++)if(freq[i] >= freq[t])t = i;
    ans = (ans + t) % mod;
    cout << ans << "\n";


}

/*

*/
int bigmod(int a, int n){
    int ans = 1;
    while(n){
        if(n & 1)ans = (LL)ans * a % mod;
        n >>= 1;
        a = (LL) a * a % mod;
    }
    return ans;
}

void pre(){
    f[0] = 1;
    for(int i = 1; i < N; i++)f[i] = (LL)f[i - 1] * i % mod;
    invf[N - 1] = bigmod(f[N - 1], mod - 2);
    for(int i = N - 2; i >= 0; i--)invf[i] = (LL)invf[i + 1] * (i + 1) % mod;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(NULL);

    pre();
    int T;
    cin >> T;
    for(int i = 1; i <= T; i++){
        testcase(i);
    }
    return 0;
}