#include<bits/stdc++.h>
#define LL long long
#define ULL unsigned long long

#define scl(i) scanf("%lld", &i)
#define scll(i, j) scanf("%lld %lld", &i, &j)
#define sclll(i, j, k) scanf("%lld %lld %lld", &i, &j, &k)
#define scllll(i, j, k, l) scanf("%lld %lld %lld %lld", &i, &j, &k, &l)

#define scs(i) scanf("%s", i)
#define sci(i) scanf("%d", &i)
#define scd(i) scanf("%lf", &i)
#define scIl(i) scanf("%I64d", &i)
#define scii(i, j) scanf("%d %d", &i, &j)
#define scdd(i, j) scanf("%lf %lf", &i, &j)
#define scIll(i, j) scanf("%I64d %I64d", &i, &j)
#define sciii(i, j, k) scanf("%d %d %d", &i, &j, &k)
#define scddd(i, j, k) scanf("%lf %lf %lf", &i, &j, &k)
#define scIlll(i, j, k) scanf("%I64d %I64d %I64d", &i, &j, &k)
#define sciiii(i, j, k, l) scanf("%d %d %d %d", &i, &j, &k, &l)
#define scdddd(i, j, k, l) scanf("%lf %lf %lf %lf", &i, &j, &k, &l)
#define scIllll(i, j, k, l) scanf("%I64d %I64d %I64d %I64d", &i, &j, &k, &l)

#define lson l, m, rt<<1
#define rson m+1, r, rt<<1|1
#define lowbit(i) (i & (-i))
#define mem(i, j) memset(i, j, sizeof(i))

#define fir first
#define sec second
#define VI vector<int>
#define ins(i) insert(i)
#define pb(i) push_back(i)
#define pii pair<int, int>
#define VL vector<long long>
#define mk(i, j) make_pair(i, j)
#define all(i) i.begin(), i.end()
#define pll pair<long long, long long>

#define _TIME 0
#define _INPUT 0
#define _OUTPUT 0
clock_t START, END;
void __stTIME();
void __enTIME();
void __IOPUT();
using namespace std;

struct Palindromic_Tree {
    ;
     ;

    deque<int> text;
    int len[maxn];///len[i]表示节点i表示的回文串的长度
    int cnt[maxn];///第 i 节点表示的回文串出现的次数、注意最后调用 getCnt 函数完成计算
    int num[maxn];///表示以节点 i 代表的回文串端点为端点的不同回文串个数
    int nxt[maxn][Letter];///nxt静态指针和字典树类似，指向的串为当前串两端加上同一个字符构成
    int fail[maxn];///失配指针
    int odd, even;///奇偶原始节点
    int pre, suf;
    int totNode;///自动机所有节点的个数
    LL totNum;///串中所有回文串数量

    int newNode(int _len){
        int ret = totNode++;
        len[ret] = _len;
        cnt[ret] = num[ret] = ;
        fail[ret] = ;
        memset(nxt[ret], , sizeof(nxt[ret]));
        return ret;
    }

    inline void init(){
        text.clear();
        totNode = ;
        totNum = ;
        even = newNode();
        odd = newNode(-);
        fail[even] = fail[odd] = odd;
        pre = suf = even;
    }

    int encode(char c){
        return c - 'a';
    }

    template<typename FunT>
    int getFail(int ch, int cur, FunT getNext){
        for(int i = getNext(len[cur]);
            i <  || i >= (int)text.size() || text[i] != ch;
            cur = fail[cur], i = getNext(len[cur]));
        return cur;
    }

    template<typename FunT>
    int Insert(int ch, int last, FunT getNext){
        last = getFail(ch, last, getNext);
        if(!nxt[last][ch]){
            );
            fail[cur] = nxt[getFail(ch, fail[last], getNext)][ch];
            nxt[last][ch] = cur;
            num[cur] = num[fail[cur]] + ;
        }

        last = nxt[last][ch];
        totNum += (LL)num[last];
        cnt[last]++;
        return last;
    }

    int push_front(char c){
        text.push_front(encode(c));
        pre = Insert(encode(c), pre, [](; });
        if(len[pre] == (int)text.size()) suf = pre;
        return totNode;
    }

    int push_back(char c){
        text.push_back(encode(c));
        suf = Insert(encode(c), suf, [; });
        if(len[suf] == (int)text.size()) pre = suf;
        return totNode;
    }

    int push_front(char *s){
        ;
        ; s[i]; i++)
            ret = push_front(s[i]);
        return ret;
    }

    int push_back(char *s){
        ;
        ; s[i]; i++)
            ret = push_back(s[i]);
        return ret;
    }

    inline void getCnt(){
        ; i>=; i--)
            cnt[fail[i]] += cnt[i];
    }

}PAM1, PAM2;

;
;

char str[maxn];
LL L[maxn], R[maxn];

int main(void){__stTIME();__IOPUT();

    int T;
    sci(T);
    while(T--){
        mem(L, );
        mem(R, );
        PAM1.init();
        PAM2.init();
        scs(str);
        int len = strlen(str);
        ; i<len; i++){
            PAM1.push_back(str[i]);
            L[i] = PAM1.totNode - ;
        }
        ; i>=; i--){
            PAM2.push_back(str[i]);
            R[i] = PAM2.totNode - ;
        }

        LL ans = ;
        ; i<len; i++){
             * R[i+]){
                ) ans = 1LL;
                ans = (1LL * (i+) * ans) % mod;
            }
        }

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

__enTIME();;}

void __stTIME()
{
    #if _TIME
        START = clock();
    #endif
}

void __enTIME()
{
    #if _TIME
        END = clock();
        cerr<<"execute time = "<<(double)(END-START)/CLOCKS_PER_SEC<<endl;
    #endif
}

void __IOPUT()
{
    #if _INPUT
        freopen("in.txt", "r", stdin);
    #endif
    #if _OUTPUT
        freopen("out.txt", "w", stdout);
    #endif
}