#include<bits/stdc++.h>
using namespace std;
#define ll long long 
#define ull unsigned long long
#define sort stable_sort 
#define endl '\n'
const ll mod=100003579,base=13331;
ll a[2000010],jc[2000010],ans[2000010],lazy[2000010];
char s[2000010],t[2000010];
void sx_hash(char s[],ll len)
{
	for(ll i=0;i<=len;i++)
	{
		a[i]=(i==0)?0:(a[i-1]*base%mod+s[i])%mod;
	}
}
ll ask_hash(ll l,ll r)
{
	return (l<=r)?(a[r]-a[l-1]*jc[r-l+1]%mod+mod)%mod:0;
}
ll change_hash(ll l,ll r,ll pos)
{

	return (l<=pos&&pos<=r)?(ask_hash(l,r)+(t[pos]-s[pos])*jc[r-pos]%mod+mod)%mod:ask_hash(l,r);
}
ll lcp(ll x,ll y,ll len)
{
	ll l=1,r=len,mid,ans=0;
	while(l<=r)
	{
		mid=(l+r)/2;
		if(ask_hash(x,x+mid-1)==ask_hash(y,y+mid-1))
		{
			ans=mid;
			l=mid+1;
		}
		else
		{
			r=mid-1;
		}
	}
	return ans;
}
int main()
{
// #define Isaac
#ifdef Isaac
	freopen("in.in","r",stdin);
	freopen("out.out","w",stdout);
#endif
	ll n,len,border=0,i;
	cin>>(s+1)>>(t+1);
	n=strlen(s+1);
	jc[0]=1;
	sx_hash(s,n);
	for(i=1;i<=n;i++)
	{
		jc[i]=jc[i-1]*base%mod;
	}
	for(i=1;i<=n-1;i++)
	{
		border=(ask_hash(1,i)==ask_hash(n-i+1,n))?i:border;
		len=lcp(1,n-i+1,i);
		if(len!=i)
		{
			if(s[len+1]!=t[len+1]&&change_hash(1,i,len+1)==change_hash(n-i+1,n,len+1))
			{
				ans[len+1]=i;
			}
			if(s[n-i+1+len]!=t[n-i+1+len]&&change_hash(1,i,n-i+1+len)==change_hash(n-i+1,n,n-i+1+len))
			{
				ans[n-i+1+len]=i;
			}
		}
		else
		{
			if(i<n-i+1)
			{
				lazy[i+1]=lazy[n-i]=i;
			}
		}
	}
	for(i=1;i<=n&&i<=n-i+1;i++)
	{
		lazy[i]=max(lazy[i],lazy[i-1]);
	}
	for(i=n;i>=1&&i>=n-i+1;i--)
	{
		lazy[i]=max(lazy[i],lazy[i+1]);
	}
	for(i=1;i<=n;i++)
	{
		cout<<((s[i]==t[i])?max({ans[i],lazy[i],border}):max(ans[i],lazy[i]))<<endl;
	}
	return 0;
}