#include <bits/stdc++.h>
using namespace std;

#define int long long
#define ll long long
#define ull unsigned long long
#define inf 0x3f3f3f3f3f3f3f3f // int请忽略后四个3f
#define endl '\n'
#define YES cout<<"YES\n";
#define NO cout<<"NO\n";

const double eps = 1e-14;
const int maxn = 3e5 + 10;
const int mod = 998244353;

inline int read()
{
    int x=0,f=1;
    char ch=getchar();
    while(ch<'0'||ch>'9')
    {
        if(ch=='-')
            f=-1;
        ch=getchar();
    }
    while(ch>='0' && ch<='9')
        x=x*10+ch-'0',ch=getchar();
    return x*f;
}
void kmp_pre(string t, vector<int>& NEX_) {
    //角标从0开始
    NEX_.resize(t.size());
    int j;
    NEX_[0] = 0;
    for (int i = 1; i < t.size(); i++) {
        j = NEX_[i - 1];//j是s[0]到s[i-1]的模式串长度,即下一位的角标
        while (t[i] != t[j] && j > 0)
            j = NEX_[j - 1];
        if (t[i] == t[j])NEX_[i] = j + 1;
        else NEX_[i] = j;//跳出循环时j=0
    }
}
void solve(int _) {
   string s;
   cin>>s;
   vector<int>v;
   kmp_pre(s,v);
   for(auto i:v)cout<<i<<" ";
}
signed main() {
   ios::sync_with_stdio(false);
   cin.tie(0); cout.tie(0);
   int _ = 1;
   // cin >> _;
   for (int i = 1; i <= _; i++) {
      solve(i);
   }
}