#include <bits/stdc++.h>

using ll = long long;
const int N = 2e7 + 5;

int n, m, z[N];
char a[N];

inline void Z(int n, char *s) {
	memset(z, 0, sizeof(int) * (n + 1));
	z[1] = n;
	int l = 0, r = 0;
	for (int i = 2; i <= n; ++i) {
		if (i <= r) z[i] = std::min(z[i - l + 1], r - i + 1);
		while (i + z[i] <= n && s[i + z[i]] == s[z[i] + 1]) ++z[i];
		if (i + z[i] - 1 > r) l = i, r = i + z[i] - 1;
	}
}

int main() {
	scanf("%s", a + 1), n = strlen(a + 1);
	Z(n, a);
	z[1] = 0;
	for (int i = 1; i <= n; ++i) printf("%d ", z[i]); puts("");
	return 0;
}