#include<iostream>
#include<cstring>
#include<cstdio>
#include<cstdlib>
#include<algorithm>
typedef unsigned long long ll;
using namespace std;
char b[200001];
ll z[200001],ans,n,m;
void fz(){
	z[1]=m;
	ll l=1,r=1;
	for(ll i=2;i<=m;i++){
		if(i<=r)z[i]=min(z[i-l+1],r-i+1);
		while(i+z[i]<=m&&b[i+z[i]]==b[z[i]+1])z[i]++;
		if(i+z[i]-1>r)r=i+z[i]-1,l=i;
	}
	z[1]=0;
	for(ll i=1;i<=m;++i){
		printf("%lld ",z[i]);
	}
}
int main(){
	scanf("%s",b+1);
	m=strlen(b+1);
	fz();
	return 0;
}