#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef tuple<ll, ll, ll> tlll;

#define rep(i, a, b) for (int i = (a); i <= (b); ++i)

#define N 1000007

int n, m, mx[N];

char s[N], t[N], S[N << 1];

int nxt[N << 1], fa[N];

int main() {
	while (scanf("%s", s + 1) != EOF) {

		scanf("%s", t + 1);
		int n = strlen(s + 1), m = strlen(t + 1);

		rep(i, 0, n) mx[i] = fa[i] = 0;
		int tot = 0, pos = 0; 
		rep(i, 1, n) S[++tot] = s[i];
		S[++tot] = '#';
		rep(i, 1, m) S[++tot] = t[i];

		rep(i, 2, tot) {
			while (pos && S[pos + 1] != S[i]) pos = nxt[pos];
			pos += (pos ? 1 : (S[1] == S[i]));
			nxt[i] = pos;
			if (i <= n) fa[i] = nxt[i];
		}
		mx[0] = (nxt[tot] == n ? nxt[nxt[tot]] : nxt[tot]);
		
		pos = 0;
		rep(i, 2, m) {
			while (pos && t[pos + 1] != t[i]) pos = nxt[pos];
			pos += (pos ? 1 : (t[1] == t[i]));
			nxt[i] = pos;
		}
		pos = 0;
		rep(i, 1, n - 1) {
			while (pos && t[pos + 1] != s[i]) pos = nxt[pos];
			pos += (pos ? 1 : (t[1] == s[i]));
			if (pos == m) {
				mx[i - m] = max(mx[i - m], i);
				pos = nxt[pos];
			}
		}

		rep(i, 0, n - 1) {
			mx[i] = max(mx[i], mx[fa[i]]);
			printf("%d ", mx[i]);
		}
		puts(""); 
	}
	return 0;	
}