//Code By CXY07 - It's My Fiesta.
#include<bits/stdc++.h>
using namespace std;

//#define FILE
//#define int long long
#define randint(l, r) (rand() % ((r) - (l) + 1) + (l))
#define abs(x) ((x) < 0 ? (-(x)) : (x))
#define popc(x) __builtin_popcount(x)
#define inv(x) qpow((x), mod - 2)
#define lowbit(x) ((x) & (-(x)))
#define ull unsigned long long
#define pii pair<int, int>
#define LL long long
#define mp make_pair
#define pb push_back
#define scd second
#define vec vector
#define fst first
#define endl '\n'
#define y1 _y1

const int MAXN = 2e6 + 10;
const int INF = 2e9;
const double eps = 1e-6;
const double PI = acos(-1);
//const int mod = 1e9 + 7;
//const int mod = 998244353;
//const int G = 3;
//const int base = 131;

int T, n, m;
int len[MAXN];
bool ok[MAXN], Ans[MAXN];
char s[MAXN];

template<typename T> inline bool read(T &a) {
	a = 0; char c = getchar(); int f = 1;
	while(c < '0' || c > '9') { if(c == '-') f = -1; c = getchar(); }
	while(c >= '0' && c <= '9') { a = a * 10 + (c ^ 48); c = getchar(); }
	return a *= f, true;
}

template<typename A, typename ...B>
inline bool read(A &x, B &...y) { return read(x) && read(y...); }

void solve() {
	scanf("%s", s + 1); n = strlen(s + 1);
	for(int i = 1, id = 0, mx = 0; i <= n; ++i) {
		ok[i] = Ans[i] = false;
		if(mx >= i) len[i] = min(mx - i + 1, len[(id << 1) - i]);
		else len[i] = 1;
		while(s[i + len[i]] == s[i - len[i]]) ++len[i];
		if(mx < i + len[i] - 1) mx = i + len[i] - 1, id = i;
	}
	for(int i = 1; i <= n; ++i) {
		if(i - len[i] + 1 <= 1) {
			ok[i] = true;
		}
		if(i + len[i] - 1 >= n) {
			Ans[i] = true;
		}
	}
	for(int i = n; i >= 1; --i) {
		if(Ans[i]) continue;
		if((i << 1) - 1 > n) continue;
		Ans[i] |= (ok[i] & (Ans[(i << 1) - 1]));
	}
	for(int i = 1; i <= n; ++i) 
		if(Ans[i]) printf("%d ", i);
	putchar('\n');
}

signed main () {
#ifdef FILE
	freopen(".in", "r", stdin);
	freopen(".out", "w", stdout);
#endif
	read(T);
	while(T--) solve();
	return 0;
}