// MagicDark
#include <bits/stdc++.h>
#define debug cerr << "\33[32m[" << __LINE__ << "]\33[m "
#define SZ(x) ((int) x.size() - 1)
#define all(x) x.begin(), x.end()
#define ms(x, y) memset(x, y, sizeof x)
#define F(i, x, y) for (int i = (x); i <= (y); i++)
#define DF(i, x, y) for (int i = (x); i >= (y); i--)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
template <typename T> T& chkmax(T& x, T y) {return x = max(x, y);}
template <typename T> T& chkmin(T& x, T y) {return x = min(x, y);}
template <typename T> T& read(T &x) {
	x = 0; int f = 1; char c = getchar();
	for (; !isdigit(c); c = getchar()) if (c == '-') f = - f;
	for (; isdigit(c); c = getchar()) x = (x << 1) + (x << 3) + (c ^ 48);
	return x *= f;
}
const int N = 1e5 + 10;
int n, z[N];
string st;
signed main() {
	ios::sync_with_stdio(0); // don't use puts
	cin.tie(0), cout.tie(0);
	cin >> st;
	n = st.size();
	st = ' ' + st + '#';
	int mx = 0, pos;
	F(i, 2, n) {
		if (i <= mx) z[i] = min(z[i - pos + 1], mx - i + 1);
		// debug << st[z[i]] << " " << st[i + z[i]] << endl;
		while (st[1 + z[i]] == st[i + z[i]]) z[i]++;
		if (i + z[i] - 1 > mx) {
			mx = i + z[i] - 1;
			pos = i;
		}
	}
	F(i, 1, n) cout << z[i] << ' ';
	return 0;
}
/* why?
*/