#include<map>
#include<set>
#include<queue>
#include<deque>
#include<cmath>
#include<ctime>
#include<bitset>
#include<vector>
#include<cstdio>
#include<string>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<unordered_map>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned int uint;
typedef unsigned long long ull;
#define mkp make_pair
#define lb lower_bound
#define ub upper_bound
#define eb emplace_back
#define fs fflush(stdout)
#define ump unordered_map
#define pq priority_queue
#define clz __builtin_clz
#define ctz __builtin_ctz
#define space putchar(' ')
#define enter putchar('\n')
#define sz(x) (int)x.size()
#define np next_permutation
#define clzl __builtin_clzll
#define par __builtin_parity
#define ctzl __builtin_ctzll
#define ppc __builtin_popcount
#define parl __builtin_parityll
#define all(x) x.begin(),x.end()
#define ppcl __builtin_popcountll
#define ms(x,y) memset(x,y,sizeof(x))
#define debug(x) cerr<<#x<<"= "<<(x)<<'\n'
template<class T> inline T &read(T &x){
	x=0;int f=1;char ch=getchar();
	while(ch<48||ch>57){if(ch=='-') f=-f;ch=getchar();}
	while(ch>=48&&ch<=57) x=(x<<1)+(x<<3)+(ch^48),ch=getchar();
	return x*=f;
}
template<class T> inline void print(T x){
	static char buf[40];static int cnt=0;
	if(x<0) putchar(45),x=-x;
	do buf[++cnt]=x%10^48;while(x/=10);
	do putchar(buf[cnt--]);while(cnt);
}
#define mod 998244353
#define inf 0x3f3f3f3f
#define fpi freopen("","r",stdin)
#define fpo freopen("","w",stdout)
char s[1000005];
int l,len[1000005];
bool vis[1000005];
int manacher(){
	int pos=0,ans=0,maxn=0,i;
	s[0]='$';
	for(i=1;i<=l;i++){
		if(i>=maxn) len[i]=1;else len[i]=min(maxn-i,len[(pos<<1)-i]);
		while(s[i-len[i]]==s[i+len[i]]) len[i]++;
		if(i+len[i]>maxn) maxn=i+len[i],pos=i;ans=max(ans,len[i]);
	}return ans-1;
}
int main(){
	int t=read(t);
	while(t--){
		scanf("%s",s+1),l=strlen(s+1),manacher();int i;
		for(i=1;i<=l;i++) vis[i]=0;
		vis[l]=1;for(i=l;i;i--) if(i+len[i]>l||(len[i]==i&&vis[(i<<1)-1])) vis[i]=1;
		for(i=1;i<=l;i++) if(vis[i]) print(i),space;enter; 
	}
	return 0;
}