E.cpp

// #pragma GCC optimize("Ofast,unroll-loops")
// #pragma GCC target("avx,avx2,fma")

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

#define ll long long
#define ull unsigned long long
#define dd double
#define ld long double
#define sl(n) scanf("%lld", &n)
#define si(n) scanf("%d", &n)
#define sd(n) scanf("%lf", &n)
#define pll pair <ll, ll>
#define pii pair <int, int>
#define mp make_pair
#define pb push_back
#define all(v) v.begin(), v.end()
#define inf (1LL << 61)
#define loop(i, start, stop, inc) for(ll i = start; i <= stop; i += inc)
#define for1(i, stop) for(ll i = 1; i <= stop; ++i)
#define for0(i, stop) for(ll i = 0; i < stop; ++i)
#define rep1(i, start) for(ll i = start; i >= 1; --i)
#define rep0(i, start) for(ll i = (start-1); i >= 0; --i)
#define ms(n, i) memset(n, i, sizeof(n))
#define casep(n) printf("Case %lld:", ++n)
#define pn printf("\n")
#define pf printf
#define EL '\n'
#define fastio std::ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);

const ll sz = 105, mod = 1e9 + 7;
char s[sz];

ll dp[sz][sz*25];

ll solve(ll pos, ll sum)
{
    if(sum < 0)
        return 0;

    if(pos == 0)
        return sum == 0;

    ll &ret = dp[pos][sum];
    if(ret != -1)
        return ret;

    ret = 0;
    for0(i, 26) {
        ret += solve(pos-1, sum-i);

        if(ret >= mod) ret -= mod;
    }

    return ret;
}

int main()
{
    ll t;
    cin >> t;

    ms(dp, -1);

    while(t--) {
        scanf("%s", s+1);
        ll len = strlen(s+1);

        ll tot = 0;
        for1(i, len) tot += (s[i] - 'a');

        ll ans = solve(len, tot) - 1;
        if(ans < 0) ans += mod;

        pf("%lld\n", ans);
    }

    return 0;
}