#include <bits/stdc++.h>
using namespace std;
const int N = 107;
const int M = 107 * 26;
const int inf = (int)1e9 + 7;
const long long base = (long long)1e18;
const double pi = acos(-1);
const double ep = 1e-18;
int dp[107][M];
void solve() {
  dp[0][0] = 1;
  for (int i = 1; i < N; i++) {
    for (int j = 0; j < M; j++) {
      for (int t = 0; t <= min(25, j); t++)
        dp[i][j] = (dp[i][j] + dp[i - 1][j - t]) % inf;
    }
  }
  int test;
  cin >> test;
  while (test-- > 0) {
    string s;
    cin >> s;
    int sum = 0;
    for (int i = 0; i < s.size(); i++) sum += s[i] - 'a';
    cout << dp[s.size()][sum] - 1 << endl;
  }
}
int main() {
  solve();
  return 0;
}
