#include <bits/stdc++.h>

const int N = 1e6 + 50;
int n, Z[N];
char s[N];

int main() {
	scanf("%s", s + 1);
	n = strlen(s + 1);
	for (int i = 2, l = 0, r = 0; i <= n; ++i) {
		if (i <= r)
			Z[i] = std::min(r - i + 1, Z[i - l + 1]);
		while (i + Z[i] <= n && s[Z[i] + 1] == 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)
		printf("%d ", Z[i]);
}