#include<bits/stdc++.h> 
using namespace std; 
#define maxn 300009
#define ll long long 
#define fi first 
#define se second 
#define pb push_back 
#define re exit(0); 
#define left id<<1 
#define right id<<1|1 
#define _lower(x) lower_bound(v.begin(),v.end(),x)-v.begin() + 1 
const int mod = 1e9+7;  
const int INF = 1e9; 

typedef vector<int> vi ; 
typedef pair<int,int> pii ; 
typedef vector<pii> vii ; 

void add ( int &a , int b ) 
{
	a += b ; 
	if ( a >= mod ) a -= mod ; 
	if ( a < 0 ) a += mod ; 
}

template < typename T > void chkmin ( T &a , T b ) { if ( a > b ) a = b ; } 
template < typename T > void chkmax ( T &a , T b ) { if ( a < b ) a = b ; }

void runfile() { freopen ("bai1.inp","r",stdin) ; } 

int _pow ( int a , int n ) 
{
	if ( n == 0 ) return 1 ; 
	int res = _pow (a,n/2) ; 
	if ( n % 2 ) return 1ll*res*res%mod*a%mod ; 
	else return 1ll*res*res%mod ; 
}

string s ; 
int z [maxn] ; 
int main() 
{
    ios_base::sync_with_stdio(0); 
    cin.tie(0);cout.tie(0);
//    runfile() ; 
	cin >> s ; 
	int n = s.size () ; 
	int l , r = 0 ; 
	for ( int i = 1 ; i < n ; i ++ ) 
	{
		if ( i <= r ) z [i] = min (r-i+1,z[i-l]) ; 
		while ( i + z [i] <= n && s [z[i]] == s [i+z[i]]) ++ z [i] ; 
		if ( i + z [i] - 1 > r ) 
		{
			l = i , r = i + z [i] - 1 ; 
		}
	}
	for ( int i = 0 ; i < n ; i ++ ) cout << z [i] << " " ; 
}