This documentation is automatically generated by online-judge-tools/verification-helper
#define PROBLEM "https://judge.yosupo.jp/problem/zalgorithm"
#include "../../../template/template.hpp"
#include "../../../string/z-algorithm.hpp"
int main(){
cin.tie(nullptr);
ios::sync_with_stdio(false);
string s;
cin >> s;
for(const int x : z_algo(s)) cout << x << " ";
cout << "\n";
}
#line 1 "test/yosupo/String/Z-Algorithm.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/zalgorithm"
#line 1 "template/template.hpp"
#include <iostream>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <bitset>
#include <cctype>
#include <climits>
#include <functional>
#include <cassert>
#include <numeric>
#include <cstring>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define per(i, n) for(int i = (n) - 1; i >= 0; i--)
using ll = long long;
#define vi vector<int>
#define vvi vector<vi>
#define vl vector<ll>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
constexpr int mod = 1000000007;
using namespace std;
template<class T, class U>
bool chmax(T &a, const U &b){ return a < b ? (a = b, 1) : 0; }
template<class T, class U>
bool chmin(T &a, const U &b){ return a > b ? (a = b, 1) : 0; }
#line 4 "test/yosupo/String/Z-Algorithm.test.cpp"
#line 1 "string/z-algorithm.hpp"
vector<int> z_algo(const string &s){
const int n = s.size();
vector<int> z(n);
z[0] = n;
int i = 1, j = 0;
while(i < n){
while(i + j < n && s[j] == s[i + j]) j++;
z[i] = j;
if(!j){
i++;
continue;
}
int k = 1;
while(k < j && z[k] + k < j) z[i + k++] = z[k];
i += k;
j -= k;
}
return z;
}
#line 6 "test/yosupo/String/Z-Algorithm.test.cpp"
int main(){
cin.tie(nullptr);
ios::sync_with_stdio(false);
string s;
cin >> s;
for(const int x : z_algo(s)) cout << x << " ";
cout << "\n";
}