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

#define all(x) begin(x), end(x)
#ifdef local
#include <experimental/iterator>
#define safe cerr<<__PRETTY_FUNCTION__<<" line "<<__LINE__<<" safe\n"
#define debug(a...) debug_(#a, a)
#define orange(a...) orange_(#a, a)
void debug_(const char *s, auto ...a) {
  cerr << "\e[1;32m(" << s << ") = (";
  int f = 0;
  (..., (cerr << (f++ ? ", " : "") << a));
  cerr << ")\e[0m\n";
}
void orange_(const char *s, auto L, auto R) {
  cerr << "\e[1;33m[ " << s << " ] = [ ";
  using namespace experimental;
  copy(L, R, make_ostream_joiner(cerr, ", "));
  cerr << " ]\e[0m\n";
}
#else
#define safe ((void)0)
#define debug(...) safe
#define orange(...) safe
#endif

const int mod = 1000000007;
int add(int x, int y) {
  return x + y >= mod ? x + y - mod : x + y;
}
int mul(int64_t a, int64_t b) {
  return static_cast<int>(a * b % mod);
}

const int maxn = 100;
int fac[maxn], ifac[maxn], inv[maxn];
void init() {
  inv[1] = 1;
  for (int i = 2; i < maxn; i++)
    inv[i] = mul(inv[mod % i], mod - mod / i);
  fac[0] = ifac[0] = 1;
  for (int i = 1; i < maxn; i++)
    fac[i] = mul(fac[i - 1], i), ifac[i] = mul(ifac[i - 1], inv[i]);
}
int C(int n, int k) {
  if (k < 0 || n < k) return 0;
  return mul(fac[n], mul(ifac[k], ifac[n - k]));
}

/*
map<tuple<array<int, 9>, int, int>, int> mp;
int DP(array<int, 9> cnt, int rest, int mx) {
  if (cnt[8] > mx)
    return 0;
  if (rest == 0)
    return 1;
  if (auto it = mp.find({cnt, rest, mx}); it != mp.end())
    return it->second;
  int res = 0;
  for (int l = 0, r = 0; l < 9; l = r) {
    for (r = l; r < 9; r++)
      if (cnt[l] != cnt[r])
        break;
    auto c = cnt;
    c[r - 1] += 1;
    int pos = r - 1;
    while (pos + 1 < 9 && c[pos] > c[pos + 1]) swap(c[pos], c[pos + 1]);
    res = add(res, mul(r - l, DP(c, rest - 1, mx)));
  }
  return mp[{cnt, rest, mx}] = res;
}
*/

int query(array<int, 10> cnt, int rest) {
  auto vmul = [&](const vector<int> &a, const vector<int> &b) -> vector<int> {
    if (a.empty() && b.empty()) return {};
    vector<int> c(min(int(a.size() + b.size() - 1), rest + 1));
    for (size_t i = 0; i < a.size(); i++)
      for (size_t j = 0; j < b.size() && i + j < c.size(); j++)
        c[i + j] = add(c[i + j], mul(a[i], b[j]));
    return c;
  };
  int res = 0;

  const int L = ranges::max(cnt);
  const int R = rest + ranges::max(cnt);

  for (int mx = L; mx <= R; mx++) {
    vector<int> pre[11], suf[11];
    pre[0].push_back(1);
    for (int i = 0; i < 10; i++) {
      vector<int> f(mx - cnt[i] + 1);
      for (size_t j = 0; j < f.size(); j++)
        f[j] = ifac[j];
      pre[i + 1] = vmul(pre[i], f);
    }
    suf[10].push_back(1);
    for (int i = 9; i >= 0; i--) {
      vector<int> f(mx - cnt[i]);
      for (size_t j = 0; j < f.size(); j++)
        f[j] = ifac[j];
      suf[i] = vmul(suf[i + 1], f);
    }
    for (int d = 0; d < 10; d++) {
      int coef = mul(d, C(rest, mx - cnt[d]));
      if (!coef) continue;
      int sum = 0;
      const auto &A = pre[d];
      const auto &B = suf[d + 1];
      int deg = rest - (mx - cnt[d]);
      coef = mul(coef, fac[deg]);
      for (int i = 0; i < int(A.size()) && i <= deg; i++) {
        if (deg - i < int(B.size()))
          sum = add(sum, mul(A[i], B[deg - i]));
      }
      res = add(res, mul(sum, coef));
    }
  }
  return res;
}

void solve() {
  string s;
  cin >> s;

  {
    ranges::reverse(s);
    int carry = 1;
    for (size_t i = 0; i < s.size() && carry; i++) {
      int z = (s[i] - '0') + carry;
      s[i] = char(z % 10 + '0');
      carry = z / 10;
    }
    if (carry)
      s += char(carry + '0');
    ranges::reverse(s);
  }

  int ans = 0;
  array<int, 10> cnt = {};
  for (size_t i = 0; i < s.size(); i++) {
    int d = s[i] - '0';
    for (int j = (i==0 ? 1 : 0); j < d; j++) {
      auto c = cnt;
      c[j] += 1;
      ans = add(ans, query(c, s.size() - i - 1));
    }
    cnt[d] += 1;
  }
  for (size_t i = 1; i < s.size(); i++) {
    for (int j = 1; j < 10; j++) {
      array<int, 10> c = {};
      c[j] += 1;
      ans = add(ans, query(c, i - 1));
    }
  }
  cout << ans << '\n';
}

int main() {
  init();
  cin.tie(nullptr)->sync_with_stdio(false);
  int T;
  cin >> T;
  while (T--)
    solve();

}