#include <bits/stdc++.h>
#define ll long long
#define enl putchar('\n')
#define all(x) (x).begin(),(x).end()
#define debug(x) printf(" "#x":%d\n",x);
using namespace std;
const int MAXN = 1e6 + 5;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const int mod = 998244353;
typedef pair<int, int> pii;
char buf[1 << 21], * p1 = buf, * p2 = buf, obuf[1 << 21], * o = obuf, of[35];
#define gc()(p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
inline ll qpow(ll a, ll n) { ll res = 1; while (n) { if (n & 1)res = res * a % mod; n >>= 1; a = a * a % mod; }return res; }
template <class T = int>inline T read() { T s = 0, f = 1; char c = gc(); for (; !isdigit(c); c = gc())if (c == '-')f = -1; for (; isdigit(c); c = gc())s = s * 10 + c - '0'; return s * f; }
inline void read(int* a, int n) { for (int i = 1; i <= n; ++i)a[i] = read(); }
inline int inal(char* s) { int n = 0; for (s[0] = gc(); !isalpha(s[0]); s[0] = gc()); for (; isalpha(s[n]); s[++n] = gc()); return s[n] = 0, n; }
inline int indi(char* s) { int n = 0; for (s[0] = gc(); !isdigit(s[0]); s[0] = gc()); for (; isdigit(s[n]); s[++n] = gc()); return s[n] = 0, n; }
inline void outd(auto* a, int n) { for (int i = 1; i <= n; ++i)printf("%d ", a[i]); enl; }
int n, m, q;
struct Z {
    int z[MAXN], p[MAXN];
    void get_Z(char* s, int n) {
        int t = 1, lim; z[1] = 1;
        for (int i = 2; i <= n; ++i) {
            lim = t + z[t] - 1; //[1,t-1],[t,lim] 
            if (i + z[i - t + 1] - 1 < lim) {
                z[i] = z[i - t + 1];
            } else {
                z[i] = max(0, lim - i + 1);
                while (s[i + z[i]] == s[z[i] + 1])z[i]++;
            }
            if (i + z[i] > t + z[t])t = i;
        }
        z[1] = n;
    }
    void exkmp(char* s, char* u, int n, int m) {
        int t = 1, lim;
        p[1] = 0;
        for (int i = 1; i <= m; ++i) {
            lim = t + p[t] - 1; //[1,t-1],[t,lim]
            if (i + z[i - t + 1] - 1 < lim) {
                p[i] = z[i - t + 1];
            } else {
                p[i] = max(0, lim - i + 1);
                while (u[i + p[i]] == s[p[i] + 1] && p[i] + 1 <= n)p[i]++;
            }
            if (i + p[i] > t + p[t])t = i;
        }
    }
}p;
char s[MAXN];
void solve() {
    n = inal(s + 1);
    p.get_Z(s, n);
    p.z[1] = 0;
    outd(p.z, n);
}
signed main(signed argc, char const* argv[]) {
    clock_t c1 = clock();
#ifdef LOCAL
    freopen("in.in", "r", stdin);
    freopen("out.out", "w", stdout);
#endif
    //=============================================================
    int TxT = 1;
    // TxT = read();
    while (TxT--)
        solve();
    //=============================================================
#ifdef LOCAL
    end :
    cerr << "Time Used:" << clock() - c1 << "ms" << endl;
#endif
    return 0;
}