#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define i1 __int128
#define pii pair<int, int>
#define pll pair<ll, ll>
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define ep emplace
#define eb emplace_back
#define all(v) v.begin(), v.end()

using namespace std;

template<typename types>
void read(types &x) {
    x = 0; char c = getchar(); int f = 1;
    while (!isdigit(c)) { if (c == '-') f = -1; c = getchar(); }
    while (isdigit(c)) x = x * 10 + c - '0', c = getchar();
    x *= f; return;
}
void read() {}
template<typename types, typename... Args>
void read(types &x, Args&... args) {
    read(x), read(args...);
    return;
}
template<typename types>
void write(types x) {
    if (x < 0) putchar('-'), x = -x;
    types k = x / 10;
    if (k) write(k);
    putchar(x - k * 10 + '0');
    return;
}
void print() { puts(""); }
template<typename types, typename... Args>
void print(types x, Args... args) {
    write(x), putchar(' '), print(args...);
    return;
}



int main() {
    ios:: sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    string s; cin >> s; 
    int n = s.length();
    vector<int> f(n);
    for (int i = 1, l = 0, r = -1; i < n; ++i) {
        if (i < r) f[i] = min(r - i, f[i - l]);
        while (i + f[i] < n && s[i + f[i]] == s[f[i]]) ++f[i];
        if (i + f[i] > r) l = i, r = i + f[i];
    }
    for (int i : f) cout << i << ' ';
    cout << endl;
    return 0;
}