#include "bits/stdc++.h"
#define rep(i, a, n) for (auto i = a; i <= (n); ++i)
#define revrep(i, a, n) for (auto i = n; i >= (a); --i)
#define all(a) a.begin(), a.end()
#define sz(a) (int)(a).size()
template<class T> bool chmin(T &a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T> bool chmax(T &a, T b) { if (a < b) { a = b; return 1; } return 0; }
using namespace std;

void debug_out() { cerr << endl; }
template<class H, class... T> void debug_out(H h, T... t) {
	cerr << " " << to_string(h);
	debug_out(t...);
}
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: "; debug_out(__VA_ARGS__)

using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;

template<class T> struct KMP {
	const T s;
	int n;
	vi fail;
	KMP(const T &s): s(s), n(sz(s)), fail(n) {
		int j = 0;
		rep(i, 1, n - 1) {
			while (j > 0 && s[j] != s[i]) j = fail[j - 1];
			if (s[j] == s[i]) j++;
			fail[i] = j;
		}
	}

	vi match(const T &t) {
		int m = sz(t), j = 0;
		vi res(m);
		rep(i, 0, m - 1) {
			while (j > 0 && (j == n || s[j] != t[i])) j = fail[j - 1];
			if (s[j] == t[i]) j++;
			if (j == n) res[i - n + 1] = 1;
		}
		return res;
	}
};

int main() {
	ios::sync_with_stdio(0); cin.tie(0);

	string s, t;
	while (cin >> s >> t) {
		int n = sz(s), m = sz(t);
		s[n - 1] = '$';
		string ns = s + '#' + t;
		KMP k1(ns);
		int mn = k1.fail.back();
		KMP kmp(t);
		auto match = kmp.match(s);
		auto &fail = k1.fail;
		vi dp(n - 1, 0);
		rep(i, 0, n - 2) {
			if (match[i + 1]) dp[i] = i + 1;
			if (fail[i] > 0) chmax(dp[i], dp[fail[i] - 1]);
		}
		printf("%d ", mn);
		rep(i, 0, n - 2) {
			int ans = mn;
			if (dp[i] > 0) chmax(ans, m + dp[i]);
			printf("%d ", ans);
		}
		puts("");
	}
	return 0;
}