#include <bits/stdc++.h>   using namespace std;   const int md = 1e9 + 7;   int n;   char s[111];   int f[111][3333];   int main() {     int t;     f[0][0] = 1;     for (int i = 1; i <= 100; ++i) {       for (int j = 0; j <= 3000; ++j) {         for (int c = 0; c <= min(j, 25); ++c) {           f[i][j] += f[i - 1][j - c];           f[i][j] %= md;         }       }     }     scanf( %d , &t);     while (t--) {       scanf( %s , s);       int sum = 0;       for (int i = 0; i < strlen(s); ++i) sum += s[i] -  a ;       printf( %d n , (f[strlen(s)][sum] + md - 1) % md);     }     return 0;   }   