#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int N=100003;
char s[N];
int z[N],n;
int main(){
	scanf("%s",s+1);
	n=strlen(s+1);
	int mx=0,pos=0;
	for(int i=2;i<=n;++i){
		if(i<=mx) z[i]=min(z[i-pos+1],mx-i+1);
		while(z[i]+i<=n&&s[z[i]+i]==s[z[i]+1]) ++z[i];
		if(i+z[i]-1>mx) mx=i+z[i]-1,pos=i;
	}
	for(int i=1;i<=n;++i) printf("%d ",z[i]);
	putchar('\n');
	return 0;
}