#include <bits/stdc++.h>

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	std::cout.tie(nullptr);
	std::string s, t;
	while (std::cin >> s >> t) {
		int n = s.length(), m = t.length();
		s = "$" + s, t = "$" + t;
		std::vector<int> fs(n + 1, 0), ft(m + 1, 0);
		auto get_fail = [&](auto &s, auto &f) {
			for (int i = 2; i < s.length(); ++i) {
				int j = f[i - 1];
				while (j && s[j + 1] != s[i])
					j = f[j];
				if (s[j + 1] == s[i])
					f[i] = j + 1;
				else
					f[i] = 0;
			}
		};
		get_fail(s, fs), get_fail(t, ft);
		std::vector<int> vis(n + 1, 0), dummy(m + 1, 0);
		auto match = [&](auto &s, auto &t, auto &ft, auto &vis) -> int {
			int p = 0;
			for (int i = 1; i < s.length(); ++i) {
				while (p && s[i] != t[p + 1])
					p = ft[p];
				if (s[i] == t[p + 1])
					++p;
				if (p == t.length() - 1) {
					vis[i - t.length() + 2] = true;
					p = ft[p];
				}
			}
			return p;
		};
		int stborder = match(s, t, ft, vis);
		int tsborder = match(t, s, fs, dummy);
		std::vector<int> ans(n + 1, 0);
		std::cout << tsborder << " ";
		for (int i = 1; i < n; ++i) {
			if (vis[i + 1])
				ans[i] = m + i;
			else
				ans[i] = ans[fs[i]];
			if (ans[i] == n) ans[i] = fs[n];
			std::cout << std::max(ans[i], tsborder) << " ";
		}
		std::cout << '\n';
	}
}