#include <bits/stdc++.h>
using namespace std;

#define SZ(a) (int)a.size()
#define ALL(a) a.begin(), a.end()
#define FOR(i, a, b) for (int i = (a); i<(b); ++i)
#define RFOR(i, b, a) for (int i = (b)-1; i>=(a); --i)
#define MP make_pair
#define PB push_back
#define F first
#define S second
#define FILL(a, b) memset(a, b, sizeof(a))

typedef long long LL;
typedef pair<int, int> PII;
typedef vector<int> VI;

const int mod = 1'000'000'007;
const int MAX = 52;

void updAdd(int& x, int val) {
	x += val;
	if (x >= mod) {
		x -= mod;
	}
}

int mult(int a, int b) {
	return (LL)a * b % mod;
}

int fact[MAX], invFact[MAX];
int dp[11][11][MAX][MAX];
int cnt[10];

void calcDP(int maxLen, bool needZero) {
	dp[10][10][0][0] = 1;
	RFOR(curDigit, 11, 1) {
		FOR(mxDigit, curDigit, 11) {
			FOR(mxCnt, 0, maxLen + 1) {
				FOR(len, mxCnt, maxLen + 1) {
					int val = dp[curDigit][mxDigit][mxCnt][len];
					if (val == 0) {
						continue;
					}
					//cerr << curDigit << " " << mxDigit << " " << mxCnt << " " << len << endl;
					FOR(i, 0, maxLen + 1 - len - cnt[curDigit - 1]) {
						int cur = mult(invFact[i], val);
						int newCnt = cnt[curDigit - 1] + i;
						int newLen = len + newCnt;
						if (needZero && curDigit - 1 == 0) {
							cur = mult(cur, len);
						}
						if (newCnt > mxCnt) {
							updAdd(dp[curDigit - 1][curDigit - 1][newCnt][newLen], cur);
						}
						else {
							updAdd(dp[curDigit - 1][mxDigit][mxCnt][newLen], cur);
						}
					}
				}
			}
		}
	}
}

void clearDP(int maxLen) {
	memset(dp, 0, sizeof dp);
	/*FOR(curDigit, 0, 11) {
		FOR(mxDigit, curDigit, 11) {
			FOR(mxCnt, 0, maxLen + 1) {
				FOR(len, mxCnt, maxLen + 1) {
					dp[curDigit][mxDigit][mxCnt][len] = 0;
				}
			}
		}
	}*/
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	invFact[1] = 1;
	FOR(i, 2, MAX) {
		invFact[i] = mult(mod - mod / i, invFact[mod % i]);
		assert(mult(invFact[i], i) == 1);
	}
	fact[0] = invFact[0] = 1;
	FOR(i, 1, MAX) {
		fact[i] = mult(fact[i - 1], i);
		invFact[i] = mult(invFact[i - 1], invFact[i]);
		assert(mult(invFact[i], fact[i]) == 1);
	}
	int t;
	cin >> t;
	while (t--) {
		string s;
		cin >> s;
		FOR(i, 0, 10) {
			cnt[i] = 0;
		}
		calcDP(SZ(s) - 1, true);
		int ans = 0;
		FOR(mxDigit, 0, 10) {
			FOR(mxCnt, 1, SZ(s)) {
				FOR(len, mxCnt, SZ(s)) {
					updAdd(ans, mult(mult(fact[len - 1], dp[0][mxDigit][mxCnt][len]), mxDigit));
				}
			}
		}
		clearDP(SZ(s) - 1);
		FOR(i, 0, SZ(s)) {
			FOR(d, i == 0 ? 1 : 0, s[i] - '0' + (i == SZ(s) - 1 ? 1 : 0)) {
				cnt[d]++;
				calcDP(SZ(s), false);
				FOR(mxDigit, 0, 10) {
					FOR(mxCnt, 1, SZ(s) + 1) {
						updAdd(ans, mult(mult(fact[SZ(s) - i - 1], dp[0][mxDigit][mxCnt][SZ(s)]), mxDigit));
					}
				}
				clearDP(SZ(s));
				cnt[d]--;
			}
			cnt[s[i] - '0']++;
		}
		cout << ans << "\n";
	}
	return 0;
}