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

const int maxn=2e6+10;

inline int read(){
    int x=0,w=1;char c=getchar();
    while(c<'0'||c>'9'){if(c=='-')w=-1;c=getchar();}
    while(c<='9'&&c>='0'){x=(x<<3)+(x<<1)+c-'0';c=getchar();}
    return x*w;
}

int t;
int n;
char s[maxn];
int d[maxn];
bool mark[maxn];
inline void Manacher(){
    memset(d,0,sizeof(d));
    for(int i=1,l=0,r=-1;i<=n;++i){
        int j=l+r-i,k;
        if(i>r) k=1;
        else k=min(d[j],r-i+1);
        while(i-k+1>=1&&i+k-1<=2*n-1&&(s[i-k+1]==s[i+k-1]||s[i+k-1]=='?')) d[i]=k++;
        if(i+d[i]-1>r) l=i-d[i]+1,r=i+d[i]-1;
    }
}
int main(){
    t=read();
    while(t--){
        scanf("%s",s+1);
        n=strlen(s+1);
        for(int i=n+1;i<=2*n-1;++i) s[i]='?';
        Manacher(); 
        for(int i=1;i<=n;++i) mark[i]=0;
        for(int i=n;i>=1;--i){
            if(d[i]!=i) continue;
            if(i+d[i]-1>=n) mark[i]=1;
            else if(mark[i+d[i]-1]) mark[i]=1;
        }
        for(int i=1;i<=n;++i){
            if(mark[i]) printf("%d ",i);
        }
        printf("\n");
    }
    return 0;
}