#pragma GCC optimize("Ofast")
#pragma GCC target("avx2")
#include "bits/stdc++.h"
using namespace std;

using ll = long long;
using pii = pair<int, int>;

ll MOD = 1000000007ll;

ll fac[51], inv[51], ifac[51];

void pre_work() {
	fac[0] = inv[0] = ifac[0] = 1;
	fac[1] = inv[1] = ifac[1] = 1;
	for (int i = 2; i <= 50; i++) {
		fac[i] = fac[i - 1] * i % MOD;
		inv[i] = inv[MOD % i] * (MOD - MOD / i) % MOD;
		ifac[i] = ifac[i - 1] * inv[i] % MOD;
	}
}

ll f(int n, int fixed, vector<int>& pref) {
	int unfixed = n - fixed;
	int mx_pref = *max_element(begin(pref), end(pref));
	ll ans = 0;
	for (int mode = 1; mode <= 9; mode++) {
		for (int freq = mx_pref; freq <= unfixed + pref[mode]; freq++) {
			int mxj = unfixed - (freq - pref[mode]);
			auto knapsack = [&]() {
				vector<ll> dp(mxj + 1, 0);
				dp[0] = 1;
				for (int i = 0; i <= 9; i++) {
					if (i == mode) continue;
					int mxk = freq - (i > mode ? 1 : 0) - pref[i];
					if (mxk < 0) return 0ll;
					for (int j = mxj; j >= 1; j--) {
						for (int k = 1; k <= mxk && k <= j; k++) {
							dp[j] = (dp[j] + dp[j - k] * ifac[k]) % MOD;
						}
					}
				}
				return dp[mxj];
			};
			ans = (ans + knapsack() * fac[unfixed] % MOD * ifac[freq - pref[mode]] % MOD * mode % MOD);
		}
	}
	return ans;
}

void solve() {
	string s;
	cin >> s;
	int n = s.size();

	// cout << "cur: " << s << endl;

	ll ans = 0;
	vector<int> freq(10);
	
	for (int i = 1; i <= n - 1; i++) {
		for (int j = 1; j <= 9; j++) {
			freq[j] = 1;
			ll req = f(i, 1, freq);
			ans = (ans + req) % MOD;
			freq[j] = 0;
		}
	}

	for (int i = 0; i < n; i++) {
		int dig = s[i] - '0';
		for (int j = 0; j < dig; j++) {
			if (i == 0 && j == 0) continue;
			// cout << "#" << i << " " << j << endl;
			freq[j]++;
			ll req = f(n, i + 1, freq);
			ans = (ans + req) % MOD;
			freq[j]--;
		}
		freq[dig]++;
	}
	ans += f(n, n, freq);
	ans %= MOD;
	cout << ans << "\n";
}

int main() {
	pre_work();
	cin.tie(0)->sync_with_stdio(0);
	int t;
	cin >> t;
	while (t--) {
		solve();
	}	
}