#include <bits/stdc++.h>
using namespace std;
template <typename T, typename U>
inline void smin(T &a, U b) {
  if (a > b) a = b;
}
template <typename T, typename U>
inline void smax(T &a, U b) {
  if (a < b) a = b;
}
template <typename T>
inline void gn(T &first) {
  char c, sg = 0;
  while (c = getchar(), (c > '9' || c < '0') && c != '-')
    ;
  for ((c == '-' ? sg = 1, c = getchar() : 0), first = 0; c >= '0' && c <= '9';
       c = getchar())
    first = (first << 1) + (first << 3) + c - '0';
  if (sg) first = -first;
}
template <class T, class T1>
inline void gn(T &first, T1 &second) {
  gn(first);
  gn(second);
}
template <class T, class T1, class T2>
inline void gn(T &first, T1 &second, T2 &z) {
  gn(first);
  gn(second);
  gn(z);
}
template <typename T>
inline void print(T first) {
  if (first < 0) {
    putchar('-');
    return print(-first);
  }
  if (first < 10) {
    putchar('0' + first);
    return;
  }
  print(first / 10);
  putchar(first % 10 + '0');
}
template <typename T>
inline void println(T first) {
  print(first), putchar('\n');
}
template <typename T>
inline void printsp(T first) {
  print(first), putchar(' ');
}
template <class T, class T1>
inline void print(T first, T1 second) {
  printsp(first), println(second);
}
template <class T, class T1, class T2>
inline void print(T first, T1 second, T2 z) {
  printsp(first), printsp(second), println(z);
}
int power(int a, int b, int m, int ans = 1) {
  for (; b; b >>= 1, a = 1LL * a * a % m)
    if (b & 1) ans = 1LL * ans * a % m;
  return ans;
}
char s[111111];
int fac[111111];
int C[3000][3000];
void pre() {
  for (int i = 0; i < 3000; i++) {
    C[i][0] = C[i][i] = 1;
    for (int j = 1; j < i; j++)
      C[i][j] = (C[i - 1][j - 1] + C[i - 1][j]) % 1000000007;
  }
}
int main() {
  pre();
  int t;
  for (gn(t); t--;) {
    scanf("%s", s);
    int n = strlen(s);
    int m = 0;
    for (int i = 0; i < n; i++) m += s[i] - 'a';
    int ans = 0;
    for (int k = 0; k * 26 <= m; k++) {
      if (k & 1)
        ans = (ans -
               (long long)C[n + m - k * 26 - 1][m - k * 26] * C[n][k] %
                   1000000007 +
               1000000007) %
              1000000007;
      else
        ans = (ans + (long long)C[n + m - k * 26 - 1][m - k * 26] * C[n][k] %
                         1000000007) %
              1000000007;
    }
    println((ans - 1 + 1000000007) % 1000000007);
  }
  return 0;
}
