#include<bits/stdc++.h>
using namespace std;
const int mod=1e9+3579;
const int base=13331;
const int N=2e6+100;
int n,h[N],p[N];
char s[N],t[N];
int maxn[N],ans[N][26];
signed main()
{
	// freopen("q.in","r",stdin);
	// freopen("q.out","w",stdout);
	scanf("%s%s",s+1,t+1);
	n=strlen(s+1);
	p[0]=1;
	for(int i=1;i<=n;i++)p[i]=1ll*p[i-1]*base%mod;
	for(int i=1;i<=n;i++)h[i]=(h[i-1]+1ll*p[i-1]*s[i]%mod)%mod;
	for(int i=1;i<n;i++){
		if(1ll*h[i]*p[n-i]%mod==1ll*(h[n]-h[n-i]+mod)%mod){
			maxn[i]=max(maxn[i],i);
		}
		else {
			int l=1,r=i;
			while(l<r){
				int mid=(l+r)>>1;
				if(1ll*h[mid]*p[n-i]%mod==1ll*(h[n-i+mid]-h[n-i]+mod)%mod)l=mid+1;
				else r=mid;
			}
			int k=1ll*(s[n-i+l]-s[l]+mod)*p[l-1]%mod;
			int fir=k,sec=k*(l>=n-i+1);
			if(1ll*(h[i]+fir)*p[n-i]%mod==((long long)h[n]-h[n-i]+mod+sec)%mod){
				ans[l][s[n-i+l]-'a']=max(ans[l][s[n-i+l]-'a'],i);
			}
			k=1ll*(s[l]-s[n-i+l]+mod)*p[n-i+l-1]%mod;
			fir=k*(n-i+l<=i);sec=k;
			if(1ll*(h[i]+fir)*p[n-i]%mod==((long long)h[n]-h[n-i]+mod+sec)%mod){
				ans[n-i+l][s[l]-'a']=max(ans[n-i+l][s[l]-'a'],i);
			}
		}
	}
	for(int i=1;i<=n;i++)maxn[i]=max(maxn[i],maxn[i-1]);
	for(int i=1;i<=n;i++){
		if(s[i]==t[i])printf("%d\n",maxn[n]);
		else {
			printf("%d\n",max(ans[i][t[i]-'a'],maxn[min(i,n-i+1)-1]));
		}
	}
}