#include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
long long int dp[101][26]={0};

//long long int dp[2][100001]={0};
int main()
{   ios::sync_with_stdio(false);
    int t;
    cin >> t;
    while(t--){
        string s;
        cin >> s;
        if(s.size()==1){
            cout << "0" << endl;
            continue;
        }

        for(int i=0;i<26;++i){
            char a='a'+i;

            if(s[1]>=a){
                int b=s[1]-a;
                int c=s[0]+b;
                cout << c << endl;
                if(c<='z'){
                    dp[2][i]=1;
                }
                else
                    dp[2][i]=0;
            }
            else{
                int b=a-s[1];
                int c=s[0]-b;
                cout << c << endl;
                if(c>='a')
                    dp[2][i]=1;
                else
                    dp[2][i]=0;
            }
        }
        for(int i=3;i<=s.size();++i){long long int g=0;
            for(int j=0;j<26;++j){
                g+=dp[i-1][j];
                g=g%MOD;
            }
            long long int f=g;
            for(int j=s[i-1]-'a';j<='z'-'a';++j){
                dp[i][j]=g;
                g=(g-dp[i-1][j-(s[i-1]-'a')]+MOD)%MOD;
            }

            for(int j=s[i-1]-'a'-1;j>=0;--j){
                f=(f-dp[i-1][26+(j-s[i-1]+'a')]+MOD)%MOD;
                dp[i][j]=f;
            }
        }
        long long int ans=0;
        for(int i=0;i<26;++i){
            ans+=dp[s.size()][i];
            ans=ans%MOD;
        }
        cout << (ans-1+MOD)%MOD << endl;
        for(int i=2;i<=100;++i){
            for(int j=0;j<26;++j)
                dp[i][j]=0;
        }
    }
    return 0;





}