//#include <bits/stdc++.h>
#include <iostream>
#include <iomanip>
#include <math.h>
#include <cmath>
#include <algorithm>
#include <climits>
#include <functional>
#include <cstring>
#include <string>
#include <cstdlib>
#include <ctime>
#include <cstdio>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <complex>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define itn int
#define nit int
#define ll long long
#define ms multiset
#define F(i,a,b) for(register int i=a,i##end=b;i<=i##end;++i)
#define UF(i,a,b) for(register int i=a,i##end=b;i>=i##end;--i)
#define re register
#define ri re int
#define il inline
#define pii pair<int,int>
#define cp complex<double>
//#pra gma G CC opti mize(3)
using namespace std;
using std::bitset;
//using namespace __gnu_pbds;
const double Pi=acos(-1);
namespace fastIO {
	template<class T>
	inline void read(T &x) {
		x=0;
		bool fu=0;
		char ch=0;
		while(ch>'9'||ch<'0') {
			ch=getchar();
			if(ch=='-')fu=1;
		}
		while(ch<='9'&&ch>='0') x=(x*10-48+ch),ch=getchar();
		if(fu)x=-x;
	}
	inline int read() {
		int x=0;
		bool fu=0;
		char ch=0;
		while(ch>'9'||ch<'0') {
			ch=getchar();
			if(ch=='-')fu=1;
		}
		while(ch<='9'&&ch>='0') x=(x*10-48+ch),ch=getchar();
		return fu?-x:x;
	}
	char _n_u_m_[40];
	template<class T>
	inline void write(T x ) {
		if(x==0) {
			putchar('0');
			return;
		}
		T tmp = x > 0 ? x : -x ;
		if( x < 0 ) putchar('-') ;
		register int cnt = 0 ;
		while( tmp > 0 ) {
			_n_u_m_[ cnt ++ ] = tmp % 10 + '0' ;
			tmp /= 10 ;
		}
		while( cnt > 0 ) putchar(_n_u_m_[ -- cnt ]) ;
	}
	template<class T>
	inline void write(T x ,char ch) {
		write(x);
		putchar(ch);
	}
}
using namespace fastIO;
#define N 11000010
char s[N<<1],t[N];
int len[N<<1],n,ans,orz;
bool vis[N];
int main() {
	F(asdf,1,read()) {
		n=0;ans=orz=0;
		scanf("%s",t+1);
		orz=strlen(t+1);
		s[0] = '€';
		s[++n]='$';
		F(i,1,orz) {
			s[++n]=t[i];
			s[++n]='$';
		}F(i,0,n+1)len[i]=vis[i]=0;
		for(ri t=1,mid=233,r=0; t<=n; ++t) {
			if(t<=r)len[t]=min(r-t+1,len[mid+mid-t]);
			while(s[t-len[t]]==s[t+len[t]])++len[t];
			if(len[t]+t>r+1)mid=t,r=t+len[t]-1;
			if(len[t]-1>ans)ans=len[t]-1;
		}
		F(i,1,orz)len[i]=len[i<<1]>>1;
		#define n orz
		UF(i,orz,1){if(len[i]>=min(i,n-i+1)){
			if(len[i]+i>=n+1)vis[i]=true;
			else vis[i]=vis[i+len[i]-1];
		}
			
		}
		F(i,1,n)if(vis[i])write(i,' ');puts("");
	}

	return 0;
}