#include<bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define pb push_back
#define a11(x) x.begin()+1,x.end()
#define all(x) x.begin(),x.end()
typedef pair<int, int> PII;
const int MOD = 1E9 + 7;
const int mod = 998244353;
using LL = long long;
using ULL = unsigned long long;
const int N = 5e5 + 10;
auto nd_vec(int D)
{
    return vector<int>(D);
}
template <typename... R>
auto nd_vec(int D, R... r)
{
    return vector(D, nd_vec(r...));
}
template<class... Args> void _(Args... args) {
    auto _ = [&](auto x) { cout << x << " "; };
    cout << "--->";
    int arr[] = {(_(args), 0)...};
    cout << "\n";
}
/// @zsh /////////////////////////////////////////////////////////////////////////////////////////


/// @zsh ////////////////////////////////////////////////////////////////
void solve()
{
    auto get_z = [&] (string s) {
        int n = s.size();
        s = ' ' + s;
        vector<int> z(n + 1);
        z[1] = 0;
        for (int i = 2, l = 0, r = 0; i <= n; ++i) {
            if (i <= r) z[i] = min(r - i + 1, z[i - l + 1]);
            while (s[1 + z[i]] == s[i + z[i]]) z[i] ++;
            if (i + z[i] - 1 > r) l = i, r = i + z[i] - 1;
        }
        for (int i = 1; i <= n; ++i) {
            cout << z[i] << ' ';
        }
    };
    string s; cin >> s;
    get_z(s);
    
}
        

signed main()   
{   
    cin.tie(nullptr) -> ios::sync_with_stdio(false);
    //cout << fixed << setprecision(12);
    int t = 1;
    //cin >> t;
    while (t--) solve();
    return 0;
}