#include<bits/stdc++.h>
#define int long long
#define mod 998244853
#define base 1331
using namespace std;
int n,mx,hs[4000005],pw[4000005],f[4000005],ans[4000005];
string s,t;
int query(int l,int r){return (hs[r]-hs[l-1]*pw[r-l+1]%mod+mod)%mod;}
int lcp(int l1,int r1,int l2,int r2){
    int len=0,l=1,r=r1-l1+1;
    while(l<=r){
        int md=(l+r)>>1;
        if(query(l1,l1+md-1)==query(l2,l2+md-1))len=md,l=md+1;
        else r=md-1;
    }
    return len;
}
signed main(){
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	cin>>s>>t,n=s.size(),s=" "+s,t=" "+t,pw[0]=1;
    for(int i=1;i<=n;i++)pw[i]=pw[i-1]*base%mod,hs[i]=(hs[i-1]*base+s[i])%mod;
    for(int i=1;i<n;i++){
    	ans[i]=max(ans[i],f[min(i-1,n-i)]),f[i]=mx;
        int a=query(1,i),b=query(n-i+1,n);
        if(a==b){f[i]=mx=i;continue;}
        int pos=lcp(1,i,n-i+1,n)+1,len=i-pos,x=pos,y=n-len,z=n-i+y;
        if(query(pos+1,i)==query(n-len+1,n)){
            if(x<n-i+1&&t[x]==s[y])ans[x]=max(ans[x],i);
            if(y>i&&t[y]==s[x])ans[y]=max(ans[y],i);
            continue;
        }
        if(query(x+1,y-1)==query(y+1,z-1)&&query(y+1,i)==query(z+1,n)&&s[x]==t[y]&&t[y]==s[z])ans[y]=max(ans[y],i);
    }
    for(int i=1;i<=n;i++)if(s[i]==t[i])ans[i]=max(ans[i],mx);
    for(int i=1;i<=n;i++)cout<<ans[i]<<"\n";
    return 0;
}