#include<bits/stdc++.h>
#define int long long
#define ull unsigned long long
using namespace std;
const int N=2000010,P=131;
char s[N],t[N];
int n,ans[N],awa;
ull h_s[N],h_t[N],p[N];
bool same[N];
ull sub(int l,int r){return h_s[r]-h_s[l-1]*p[r-l+1];}
bool change(int len,int pos){
    ull pre=sub(1,len),suf=sub(n-len+1,n);
    if(1<=pos&&pos<=len)
        pre=pre-p[len-pos]*s[pos]+p[len-pos]*t[pos];
    if(n-len+1<=pos&&pos<=n)
        suf=suf-p[n-pos]*s[pos]+p[n-pos]*t[pos];
    if(pre==suf) return 1;
    return 0;
}
signed main(){
    scanf("%s%s",s+1,t+1);
    n=strlen(s+1);
    p[0]=1;
    for(int i=1;i<=n;i++){
        h_s[i]=h_s[i-1]*P+s[i];
        p[i]=p[i-1]*P;
    }
    for(int i=1;i<=n;i++){
        if(sub(1,i)==sub(n-i+1,n)){
            same[i]=1;
            if(i!=n) awa=i;
            continue;
        }
        int l=1,r=i;
        while(l<r){
            int mid=l+r>>1;
            if(sub(1,mid)!=sub(n-i+1,n-i+mid)) r=mid;
            else l=mid+1;
        }
        if(change(i,l)) ans[l]=max(ans[l],i);
        if(change(i,n-i+l)) ans[n-i+l]=max(ans[n-i+l],i);
    }
    int lst=0;
    for(int i=1;i<=n;i++){
        if(s[i]==t[i]){ans[i]=awa;continue;}
        if(i*2<=n||i*2==n+1){
            ans[i]=max(ans[i],lst);
            ans[n-i+1]=max(ans[n-i+1],lst);
        }
        if(i*2<=n&&same[i]) lst=i;
    }
    for(int i=1;i<=n;i++) printf("%lld\n",ans[i]);
    return 0;
}