#include <bits/stdc++.h>

using namespace std;
using arr = array<int, 10>;

const int N = 55, mod = 1e9 + 7, M = 12;
int c[N][N], f[M][N][N], g[M][N][N], mx;
bool dbg;

int calc(int n, arr &b) {
  dbg = b[1] == 1;
  memset(f, 0, sizeof f);
  f[0][0][0] = 1;
  for (int i = 0; i < 9; i++) {
    for (int j = 0; j <= n; j++) {
      for (int k = 0; k <= mx; k++) {
        if (!f[i][j][k]) continue;
        for (int l = 0; l <= n - j; l++) {
          (f[i + 1][l + j][max(k, l + b[i])] += 1ll * f[i][j][k] * c[l + j][j] % mod) %= mod;
        }
      }
    } 
  }
  memset(g, 0, sizeof g);
  g[10][0][0] = 1;
  for (int i = 10; i >= 1; i--) {
    for (int j = 0; j <= n; j++) {
      for (int k = 0; k <= mx; k++) {
        if (!g[i][j][k]) continue;
        for (int l = 0; l <= n - j; l++) {
          (g[i - 1][l + j][max(k, l + b[i - 1])] += 1ll * g[i][j][k] * c[l + j][j] % mod) %= mod;
        }
      }
    }
  }
  for (int i = 0; i <= 10; i++) {
    for (int j = 0; j <= n; j++) {
      for (int k = 1; k <= mx; k++) {
        (f[i][j][k] += f[i][j][k - 1]) %= mod;
        (g[i][j][k] += g[i][j][k - 1]) %= mod;
      }
    }
  }
  int ans = 0;
  for (int i = 1; i < 10; i++) {
    for (int j = 0; j <= n; j++) {
      int sum = 0;
      for (int k = 0; k <= n - j; k++) {
        (sum += 1ll * f[i][k][j + b[i]] * g[i + 1][n - j - k][j - 1 + b[i]] * c[n - j][k] % mod) %= mod;
      }
      (ans += 1ll * i * sum % mod * c[n][j] % mod) %= mod;
    }
  }
  return ans;
}

void solve() {
  string s;
  cin >> s;
  int n = s.size();
  arr buc;
  buc.fill(0);
  int ans = 0;
  for (int i = 1; i < n; i++) {
    mx = i;
    for (int j = 1; j < 10; j++) {
      buc[j] = 1;
      (ans += calc(i - 1, buc)) %= mod;
      buc[j] = 0;
    }
  }
  mx = n;
  for (int i = 0; i < n; i++) {
    for (int j = !i ? 1 : 0; j < s[i] - '0'; j++) {
      buc[j]++;
      (ans += calc(n - i - 1, buc)) %= mod;
      buc[j]--;
    }
    buc[s[i] - '0']++;
  }
  (ans += calc(0, buc)) %= mod;
  cout << ans << '\n';
}

int main() {
  cin.tie(0)->sync_with_stdio(0);
  int T;
  cin >> T;
  for (int i = 0; i <= 50; i++) {
    for (int j = 0; j <= i; j++) {
      c[i][j] = !j ? 1 : (c[i - 1][j] + c[i - 1][j - 1]) % mod;
    }
  }
  while (T--) solve();
}