#include <bits/stdc++.h>

using i64 = long long;


int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    
    std::string s;
    std::cin >> s;
    int n = s.size();
    std::vector<int> z(n + 1);
    z[0] = n;
    for (int i = 1 , j = 1 ; i < n ; i ++) {
        z[i] = std::max(0 , std::min((j + z[j] - i),z[i - j]));
        while(i + z[i] < n && s[z[i]] == s[i + z[i]]) {
            z[i] ++;
        }

        if (i + z[i] > j + z[j]) {
            j = i;
        }
    }

    std::cout << z[n] << ' ';
    for (int k = 1 ; k <= n - 1 ; k ++) {
        std::cout << z[k] << " \n"[k == n];
    }


    return 0;
}