#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
int N;
char s[105];
int dp[105][2605];
void pre() {
  dp[0][0] = 1;
  for (int i = 1; i <= 100; i++)
    for (int j = 0; j <= 25 * i; j++)
      for (int c = 0; c < 26; c++)
        if (j - c >= 0) (dp[i][j] += dp[i - 1][j - c]) %= mod;
}
void solve_test() {
  scanf("%s\n", s + 1);
  N = strlen(s + 1);
  int cst = 0;
  for (int i = 1; i <= N; i++) cst += s[i] - 'a';
  int ans = (dp[N][cst] - 1 + mod) % mod;
  printf("%d\n", ans);
}
int main() {
  pre();
  int T;
  scanf("%d\n", &T);
  for (int t = 1; t <= T; t++) solve_test();
  return 0;
}
