#include<bits/stdc++.h>
#define pb push_back
#define P make_pair
#define fi first
#define se second
#define bit(s,x) (((s)>>(x))&1)
#define pnp(s) __builtin_popcountll(s)
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define per(i,a,b) for(int i=(a);i>=(b);--i)
using namespace std;
typedef long long ll; 
typedef unsigned long long ull;
typedef pair<int,int> pii;
inline ll read(){
	ll x=0,f=1,c=getchar();
	while(c<'0'||c>'9')f=(c=='-'?-1:1),c=getchar();
	while(c>='0'&&c<='9')x=(x<<1)+(x<<3)+(c^48),c=getchar();
	return x*f;
}
const int N=1e5+3;
int n,Z[N];
char s[N];
int main() {
    //freopen("data.in", "r", stdin);
    //freopen("myans.out","w",stdout);
	scanf("%s",s+1);n=strlen(s+1);
	int p=0,r=0;
	rep(i,2,n){
		if(i<=r)Z[i]=min(r-i+1,Z[i-p+1]);
		while(Z[i]+i<=n&&s[Z[i]+1]==s[Z[i]+i])++Z[i];
		if(Z[i]>Z[p])p=i,r=i+Z[i]-1;
	}
	rep(i,1,n)printf("%d ",Z[i]);
    return 0;
}