#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>    // 包含 tree、gp_hash_table、cc_hash_table
#include <ext/pb_ds/priority_queue.hpp> // 引入后使用 STL 的堆需要 std::
#include <ext/rope>
using namespace __gnu_pbds;
using namespace __gnu_cxx;
using namespace std;
template<class key, class val = null_type, class cmp = less<>>
using rb_tree = tree<key, val, cmp, rb_tree_tag, tree_order_statistics_node_update>;
template<class key, class cmp = less<>>
using pairing_heap = __gnu_pbds::priority_queue<key, cmp>;
typedef long long ll;
#define int long long
template<class T> void print_debug(const T & v) { cerr << v; }
template<class T, class ... A> void print_debug(const T & v, const A & ... a) { cerr << v << ", ", print_debug(a...); }
#define debug(...) (cerr << "[" << #__VA_ARGS__ << "] = [", print_debug(__VA_ARGS__), cerr << "]\n")
mt19937_64 rd(time(0));

struct KMP : vector<int> {  // 数组表示最长真前缀和真后缀的长度
    KMP(const string & s = "") : vector(s.size()) { // 从 0 开始，前缀函数
        for (int i = 1; i < size(); at(i++) += s[i] == s[at(i)]) {
            for (at(i) = at(i - 1); at(i) && s[i] != s[at(i)]; at(i) = at(at(i) - 1));
        }
    }
    KMP(const string & t, const string & s, char o = '#') : KMP(t + o + s) {}   // t 为匹配串(去匹配)， s 为文本串(被匹配)
};

void QAQ() {
    string s;
    cin >> s;

    KMP next(s);

    for (auto & x : next) {
        cout << x << " ";
    }
}

signed main() {
    cin.tie(0) -> sync_with_stdio(0);
    cout << fixed << setprecision(12);
    int t = 1;
    // cin >> t;

    while (t--) {
        QAQ();
    }
}