// lhzawa(https://www.cnblogs.com/lhzawa/)
// Problem: A. Digit Mode
// Contest: QOJ - The 2019 ICPC China Shaanxi Provincial Programming Contest
// URL: https://qoj.ac/contest/1285/problem/6522
// Memory Limit: 256 MB
// Time Limit: 2000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

#include<bits/stdc++.h>
using namespace std;
const int N = 50 + 5;
const long long mod = 1e9 + 7;
long long fac[N], inv[N];
char s[N];
int c[N];
long long f[12][N][N], g[12][N][N];
int main() {
	fac[0] = inv[0] = 1ll;
	for (int i = 1; i < N; i++) {
		fac[i] = 1ll * fac[i - 1] * i % mod;
	}
	function<long long (long long)> iv = [](long long a) -> long long {
		long long val = 1, b = mod - 2;
		for (; b; b >>= 1, a = a * a % mod) {
			if (b & 1) {
				val = val * a % mod;
			}
		}
		return val;
	};
	inv[N - 1] = iv(fac[N - 1]);
	for (int i = N - 2; i >= 1; i--) {
		inv[i] = 1ll * inv[i + 1] * (i + 1) % mod;
	}
	function<void ()> solve = []() -> void {
		scanf("%s", s);
		int n = strlen(s);
		memset(c, 0, sizeof(c));
		function<long long (int)> _solve = [&n](int m) -> long long {
			memset(f, 0, sizeof(f)), memset(g, 0, sizeof(g));
			f[0][0][0] = 1;
			for (int x = 0; x <= 9; x++){
				for (int i = 0; i <= m; i++) {
					for (int j = 0; j <= n; j++) {
						if (f[x][i][j]) {
							for (int k = 0, zxx = c[x]; i + k <= m; k++, zxx++) {
								long long sval = f[x][i][j] * inv[k] % mod;
								f[x + 1][i + k][max(j, zxx)] = (f[x + 1][i + k][max(j, zxx)] + sval) % mod;
								if (zxx >= j) {
									g[x + 1][i + k][zxx] = (g[x + 1][i + k][zxx] + 1ll * sval * x % mod) % mod;
								}
							}
						}
					}
				}
				for (int i = 0; i <= m; i++) {
					for (int j = 0; j <= n; j++) {
						if (g[x][i][j]) {
							for (int k = 0, zxx = c[x]; i + k <= m && zxx < j; k++, zxx++) {
								g[x + 1][i + k][j] = (g[x + 1][i + k][j] + 1ll * g[x][i][j] * inv[k] % mod) % mod;
							}
						}
					}
				}
			}
			long long val = 0;
			for (int j = 0; j <= n; j++) {
				val = (val + g[10][m][j]) % mod;
			}
			return val * fac[m] % mod;
		};
		long long val = 0;
		for (int i = 1; i < n; i++) {
			for (int j = 1; j <= 9; j++) {
				c[j]++;
				val = (val + _solve(i - 1)) % mod;
				c[j]--;
			}
		}
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < (int)(s[i] - '0'); j++) {
				if (i == 0 && j == 0) {
					continue;
				}
				c[j]++;
				val = (val + _solve(n - i - 1)) % mod;
				c[j]--;
			}
			c[(int)(s[i] - '0')]++;
		}
		val = (val + _solve(0)) % mod;
		printf("%lld\n", val);
	};
	int _;
	scanf("%d", &_);
	for (; _; _--) {
		solve();
	}
	return 0;
}