# include <bits/stdc++.h>
using namespace std;
using i64 = int;
const i64 base = 131;
const int N = 1e6 + 5; 
char S[N];
int n, len; 
int ok[N]; 
array<i64, 2> Hash[N][2], mod{(i64)(1e9 + 7), 998244353}, pbase[N]; 
array<i64, 2> Get(int l, int r, int flag)
{
	// if(flag == 1) swap(l, r);
	if(l > r) return {0, 0};
	array <i64, 2> ans{0, 0}; 
	if(flag == 0)
	{
		for(int i = 0; i <= 1; i++)
			ans[i] = (Hash[r][flag][i] - (1ll * Hash[l - 1][flag][i] * pbase[r - l + 1][i] % mod[i]) + mod[i]) % mod[i];	
	}
	else
	{
		for(int i = 0; i <= 1; i++)
			ans[i] = (Hash[l][flag][i] - (1ll * Hash[r + 1][flag][i] * pbase[r - l + 1][i] % mod[i]) + mod[i]) % mod[i];
	}
	return ans;
}
int check(int x)
{	
	// printf("check : %d\n", x);
	if(ok[x] != -1) return ok[x]; 
	int l = 1, r = min(n - x + 1, x), ans = 0;
	while(l <= r) 
	{
		int mid = (l + r) >> 1; 
		if(Get(x - mid + 1, x - 1, 0) == Get(x + 1, x + mid - 1, 1)) {ans = mid; l = mid + 1; }
		else r = mid - 1;
	}
	// printf("ans = %d\n", ans);
	if(ans == min(n - x + 1, x)) 
	{
		if(ans == x) return (ok[x] = check(x + ans - 1)); 
		else return (ok[x] = 1); 
	}
	else return (ok[x] = 0);
}
int main(void)
{	
	// freopen("2.in", "r", stdin); freopen("out.out", "w", stdout);
	int Test; scanf("%d", &Test);
	pbase[0] = {1ll, 1ll}; 
	for(int i = 1; i <= N - 5; i++) 
		for(int j = 0; j <= 1; j++)
			pbase[i][j] = 1ll * pbase[i - 1][j] * base % mod[j]; 
	while(Test--)
	{
		scanf("%s", S + 1); n = strlen(S + 1); 
		for(int i = 1; i <= n; i++) 
		{
			ok[i] = -1;
			for(int j = 0; j <= 1; j++) Hash[i][0][j] = ((1ll * Hash[i - 1][0][j] * base % mod[j]) + (S[i] - 'a')) % mod[j]; 
		}
		Hash[n + 1][0] = Hash[n + 1][1] = {0, 0};
		for(int i = n; i >= 1; i--)
		{
			ok[i] = -1;
			for(int j = 0; j <= 1; j++) Hash[i][1][j] = ((1ll * Hash[i + 1][1][j] * base % mod[j]) + (S[i] - 'a')) % mod[j]; 
		}
		ok[1] = (n == 1) ? 1 : 0; 
		for(int i = 1; i <= n; i++)
		{
			if(check(i)) printf("%d ", i); 
		}
		printf("\n");
	}
	return 0; 
}