#include <bits/stdc++.h>

namespace Initial {
	#define ll int
	#define ull unsigned long long
	#define fi first
	#define se second
	#define mkp make_pair
	#define pir pair <int, int>
	#define pb push_back
	#define i128 __int128
	using namespace std;
	const ll maxn = 2e6 + 10, inf = 1e9, mod = 998244353;
	ll power(ll a, ll b = mod - 2) {
		ll s = 1;
		while(b) {
			if(b & 1) s = s * a %mod;
			a = a * a %mod, b >>= 1;
		} return s;
	}
	template <class T>
	const inline ll pls(const T x, const T y) { return x + y >= mod? x + y - mod : x + y; }
	template <class T>
	const inline void add(T &x, const T y) { x = x + y >= mod? x + y - mod : x + y; }
	template <class T>
	const inline void chkmax(T &x, const T y) { x = x < y? y : x; }
	template <class T>
	const inline void chkmin(T &x, const T y) { x = x > y? y : x; }
} using namespace Initial;

namespace Read {
	char buf[1 << 22], *p1, *p2;
//	#define getchar() (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, (1 << 22) - 10, stdin), p1 == p2)? EOF : *p1++)
	template <class T>
	const inline void rd(T &x) {
		char ch; bool neg = 0;
		while(!isdigit(ch = getchar()))
			if(ch == '-') neg = 1;
		x = ch - '0';
		while(isdigit(ch = getchar()))
			x = (x << 1) + (x << 3) + ch - '0';
		if(neg) x = -x;
	}
} using Read::rd;

const ll L = 2e6 + 10;

ll n, p[maxn], ans[maxn], res[maxn];
char a[maxn], b[maxn];

struct Hash {
	ull h1[maxn], h2[maxn], pw1[maxn], pw2[maxn];
	void Init() {
		pw1[0] = pw2[0] = 1;
		for(ll i = 1; i <= n; i++) {
			h1[i] = h1[i - 1] * 131 + a[i];
			h2[i] = h2[i - 1] * 13131 + a[i];
			pw1[i] = pw1[i - 1] * 131, pw2[i] = pw2[i - 1] * 13131;
		}
	}
	pair <ull, ull> hsh(ll l, ll r, ll x) {
		auto c = mkp(h1[r] - h1[l - 1] * pw1[r - l + 1],
		 h2[r] - h2[l - 1] * pw2[r - l + 1]);
		if(x < l || r < x) return c;
		c.fi += (b[x] - a[x]) * pw1[r - x];
		c.se += (b[x] - a[x]) * pw2[r - x];
		return c;
	}
} H;

template <class T>
const bool operator == (const pair <T, T> A, const pair <T, T> B) {
	return A.fi == B.fi && A.se == B.se;
}

signed main() {
	scanf("%s%s", a + 1, b + 1), n = strlen(a + 1);
	p[1] = n; H.Init();
	while(a[p[2] + 1] == a[p[2] + 2]) ++p[2];
	for(ll i = 3, j = 2; i <= n; i++) {
		if(j + p[j] > i) p[i] = min(j + p[j] - i, p[i - j + 1]);
		while(a[i + p[i]] == a[1 + p[i]]) ++p[i];
		if(i + p[i] > j + p[j]) j = i;
	}
	for(ll i = 1; i < n; i++)
		if(p[n - i + 1] == i) res[i] = i;
		else {
			ll x = p[n - i + 1] + 1;
			if(H.hsh(1, i, x) == H.hsh(n - i + 1, n, x))
				chkmax(ans[x], i);
			if(H.hsh(1, i, n - i + x) == H.hsh(n - i + 1, n, n - i + x))
				chkmax(ans[n - i + x], i);
		}
	for(ll i = 1; i <= n; i++) chkmax(res[i], res[i - 1]);
	for(ll i = 1; i <= n; i++) {
		chkmax(ans[i], res[min(i - 1, n - i)]);
		if(a[i] == b[i]) chkmax(ans[i], res[n]);
		printf("%d\n", ans[i]);
	}
	return 0;
}