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

const int N = 55, mod = 1e9 + 7;
int dp[11][N], C[N][N];
int yo(int n, vector<int> lim) {
  dp[0][0] = 1;
  for (int i = 1; i <= 10; i++) {
    for (int s = 0; s <= n; s++) {
      dp[i][s] = 0;
      for (int k = 0; k <= lim[i - 1]; k++) {
        if (k <= s) {
          dp[i][s] += 1LL * dp[i - 1][s - k] * C[s][k] % mod;
          dp[i][s] %= mod;
        }
      }
    }
  }
  return dp[10][n];
}
int solve(int n, vector<int> f) {
  int ans = 0;
  for (int mode = 1; mode <= 9; mode++) {
    for (int cnt = 0; cnt <= n; cnt++) {
      int tot = cnt + f[mode];
      vector<int> lim(10, 0);
      bool ok = true;
      for (int i = 0; i <= 9; i++) {
        if (i <= mode) {
          if (f[i] > tot) {
            ok = false;
          }
          else {
            lim[i] = tot - f[i];
          }
        }
        else {
          if (f[i] >= tot) {
            ok = false;
          }
          else {
            lim[i] = tot - f[i] - 1;
          }
        }
      }
      if (ok) {
        int len = n - cnt;
        lim[mode] = 0;
        if (len >= 0) {
          ans += 1LL * mode * yo(len, lim) % mod * C[n][cnt] % mod;
          ans %= mod;
        }
      }
    }
  }
  return ans;
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  for (int i = 0; i < N; i++) {
    C[i][0] = 1;
  }
  for (int i = 1; i < N; i++) {
    for (int j = 1; j <= i; j++) {
      C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % mod;
    }
  }
  int t; cin >> t;
  while (t--) {
    string s; cin >> s;
    int n = s.size();
    vector<int> f(10, 0);
    int ans = 0;
    for (int i = 1; i < n; i++) {
      int k = s[i] - '0';
      for (int j = 1; j <= 9; j++) {
        f[j]++;
        ans += solve(n - i - 1, f);
        ans %= mod;
        f[j]--;
      }
    }
    for (int i = 0; i < n; i++) {
      int k = s[i] - '0';
      for (int j = i == 0 ? 1 : 0; j < k; j++) {
        f[j]++;
        ans += solve(n - i - 1, f);
        ans %= mod;
        f[j]--;
      }
      f[k]++;
    }
    int mx = *max_element(f.begin(), f.end());
    for (int i = 9; i >= 0; i--) {
      if (f[i] == mx) {
        ans += i;
        ans %= mod;
        break;
      }
    }
    cout << ans << '\n';
  }
  return 0;
}