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


// Source: neal
// Modulo arithmetic
template <const int &MOD>
struct _m_int {
  int val;

  _m_int(int64_t v = 0) {
    if (v < 0) v = v % MOD + MOD;
    if (v >= MOD) v %= MOD;
    val = int(v);
  }

  _m_int(uint64_t v) {
    if (v >= MOD) v %= MOD;
    val = int(v);
  }

  _m_int(int v) : _m_int(int64_t(v)) {}
  _m_int(unsigned v) : _m_int(uint64_t(v)) {}

  static int inv_mod(int a, int m = MOD) {
    // https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm#Example
    int g = m, r = a, x = 0, y = 1;

    while (r != 0) {
      int q = g / r;
      g %= r;
      swap(g, r);
      x -= q * y;
      swap(x, y);
    }

    return x < 0 ? x + m : x;
  }

  explicit operator int() const { return val; }
  explicit operator unsigned() const { return val; }
  explicit operator int64_t() const { return val; }
  explicit operator uint64_t() const { return val; }
  explicit operator double() const { return val; }
  explicit operator long double() const { return val; }

  _m_int &operator+=(const _m_int &other) {
    val -= MOD - other.val;
    if (val < 0) val += MOD;
    return *this;
  }

  _m_int &operator-=(const _m_int &other) {
    val -= other.val;
    if (val < 0) val += MOD;
    return *this;
  }

  static unsigned fast_mod(uint64_t x, unsigned m = MOD) {
#if !defined(_WIN32) || defined(_WIN64)
    return unsigned(x % m);
#endif
    // Optimized mod for Codeforces 32-bit machines.
    // x must be less than 2^32 * m for this to work, so that x / m fits in an
    // unsigned 32-bit int.
    unsigned x_high = unsigned(x >> 32), x_low = unsigned(x);
    unsigned quot, rem;
    asm("divl %4\n" : "=a"(quot), "=d"(rem) : "d"(x_high), "a"(x_low), "r"(m));
    return rem;
  }

  _m_int &operator*=(const _m_int &other) {
    val = fast_mod(uint64_t(val) * other.val);
    return *this;
  }

  _m_int &operator/=(const _m_int &other) { return *this *= other.inv(); }

  friend _m_int operator+(const _m_int &a, const _m_int &b) {
    return _m_int(a) += b;
  }
  friend _m_int operator-(const _m_int &a, const _m_int &b) {
    return _m_int(a) -= b;
  }
  friend _m_int operator*(const _m_int &a, const _m_int &b) {
    return _m_int(a) *= b;
  }
  friend _m_int operator/(const _m_int &a, const _m_int &b) {
    return _m_int(a) /= b;
  }

  _m_int &operator++() {
    val = val == MOD - 1 ? 0 : val + 1;
    return *this;
  }

  _m_int &operator--() {
    val = val == 0 ? MOD - 1 : val - 1;
    return *this;
  }

  _m_int operator++(int) {
    _m_int before = *this;
    ++*this;
    return before;
  }
  _m_int operator--(int) {
    _m_int before = *this;
    --*this;
    return before;
  }

  _m_int operator-() const { return val == 0 ? 0 : MOD - val; }

  friend bool operator==(const _m_int &a, const _m_int &b) {
    return a.val == b.val;
  }
  friend bool operator!=(const _m_int &a, const _m_int &b) {
    return a.val != b.val;
  }
  friend bool operator<(const _m_int &a, const _m_int &b) {
    return a.val < b.val;
  }
  friend bool operator>(const _m_int &a, const _m_int &b) {
    return a.val > b.val;
  }
  friend bool operator<=(const _m_int &a, const _m_int &b) {
    return a.val <= b.val;
  }
  friend bool operator>=(const _m_int &a, const _m_int &b) {
    return a.val >= b.val;
  }

  _m_int inv() const { return inv_mod(val); }

  _m_int pow(int64_t p) const {
    if (p < 0) return inv().pow(-p);

    _m_int a = *this, result = 1;

    while (p > 0) {
      if (p & 1) result *= a;

      p >>= 1;

      if (p > 0) a *= a;
    }

    return result;
  }

  friend ostream &operator<<(ostream &os, const _m_int &m) {
    return os << m.val;
  }

  friend istream &operator>>(istream &is, _m_int &m) {
    int64_t x;
    is >> x;
    m = _m_int(x);
    return is;
  }
};

const int MOD = 1e9+7;
using mod_int = _m_int<MOD>;


// Source: Based on neal's choose implementation
// Tested on: ABC 235 G
namespace internal_choose {
std::vector<mod_int> factorial = {1}, inv_factorial = {1};
int built_max = 0;

void prepare_factorials(int max) {
  if (max <= built_max) return;
  max += max / 100;
  factorial.resize(max + 1);
  inv_factorial.resize(max + 1);
  for (int i = built_max + 1; i <= max; i++)
    factorial[i] = i * factorial[i - 1];
  inv_factorial[max] = factorial[max].inv();
  for (int i = max - 1; i > built_max; i--)
    inv_factorial[i] = inv_factorial[i + 1] * (i + 1);
  built_max = max;
}
};  // namespace internal_choose

mod_int factorial(int n) {
  if (n < 0) return 0;
  internal_choose::prepare_factorials(n);
  return internal_choose::factorial[n];
}

mod_int inv_factorial(int n) {
  if (n < 0) return 0;
  internal_choose::prepare_factorials(n);
  return internal_choose::inv_factorial[n];
}

mod_int choose(int n, int r) {
  if (r < 0 || r > n) return 0;
  internal_choose::prepare_factorials(n);
  return internal_choose::factorial[n] * internal_choose::inv_factorial[n - r] *
         internal_choose::inv_factorial[r];
}

mod_int permute(int n, int r) {
  if (r < 0 || r > n) return 0;
  internal_choose::prepare_factorials(n);
  return internal_choose::factorial[n] * internal_choose::inv_factorial[n - r];
}

mod_int inv_choose(int n, int r) {
  assert(r >= 0 && r <= n);
  internal_choose::prepare_factorials(n);
  return internal_choose::inv_factorial[n] * internal_choose::factorial[n - r] *
         internal_choose::factorial[r];
}

mod_int inv_permute(int n, int r) {
  assert(r >= 0 && r <= n);
  internal_choose::prepare_factorials(n);
  return internal_choose::inv_factorial[n] * internal_choose::factorial[n - r];
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);

  int tt;
  cin >> tt;
  while(tt--) {
    string n;
    cin >> n;

    auto poly_mult = [&](vector<mod_int>& a, vector<mod_int>& b, int tot_size)->vector<mod_int> {
      vector<mod_int> res(tot_size);
      for (int i =0; i < a.size(); i++) {
        for (int j =0; j < b.size(); j++) {
          if (i + j >= tot_size) break;
          res[i+j] += a[i] * b[j];
        }
      }
      return res;
    };

    auto F = [&](auto& self, int digit_count, array<int, 10>& start_count, bool can_start_zero)->mod_int {
      if (digit_count == 0) {
        int mxidx = 0;
        for (int i = 1; i < 10; i++) {
          if (start_count[mxidx] <= start_count[i]) mxidx = i;
        }
        return mxidx;
      }
      mod_int ans = 0;
      for (int mode = 1; mode < 10; mode++) {
        for (int mode_cnt = 0; mode_cnt <= digit_count; mode_cnt++) {
          int need = digit_count - mode_cnt;
          vector<mod_int> res(need+1);
          res[0] = 1;
          for (int j = 0; j < 10; j++) {
            if (j == mode) continue;
            vector<mod_int> poly;
            for (int jcnt = 0; jcnt+start_count[j] <= (j < mode?mode_cnt + start_count[mode]:mode_cnt + start_count[mode]-1); jcnt++) {
              poly.push_back(inv_factorial(jcnt));
            }
            if (poly.empty()) {
              res[need] = 0;
              break;
            }
            res = poly_mult(res, poly, need+1);
          }
          ans += mode*factorial(digit_count) * res[need] * inv_factorial(mode_cnt);
        }
      }
      if (!can_start_zero) {
        start_count[0]++;
        ans -= self(self, digit_count - 1, start_count, true);
        start_count[0]--;
      }
      return ans;
    };

    mod_int ans =0 ;
    for (int i = 1; i < n.size(); i++) {
      array<int, 10> a = {0};
      ans += F(F, i, a, false);
    }
    
    int curr_dig_cnt = n.size();
    array<int, 10> digcnt = {0};
    for (int i = 0; i < n.size(); i++) {
      curr_dig_cnt--;
      for (int add_dig = (i==0?1:0); add_dig < n[i] - '0'; add_dig++) {
        digcnt[add_dig]++;
        ans += F(F, curr_dig_cnt, digcnt, true);
        digcnt[add_dig]--;
      }
      digcnt[n[i] - '0']++;
    }
    ans += F(F, curr_dig_cnt, digcnt, true);
    cout << ans << '\n';
  }
}
// Solve for f(
// number of digits,
// starting count of each digit
// is a starting zero allowed
// )
//
// This is called O(|n| + 8|n|)ish
// 10 * |n| * 10 (mode value) * |n| (node count) *  |n| * |n| * |n| * 2 (for zero)
// 200 * |n|^4 * log |n|