#include <bits/stdc++.h>
#define il inline
using namespace std;
typedef unsigned long long ll;
const ll mul=131;
il void cmax(int &x,int y){x=x>y?x:y;}
const int N=2e6+5;
int n,ans[N],ck[N];char s[N],t[N],ss[N];ll h[N],pw[N];
il ll get(int l,int r){return h[r]-h[l-1]*pw[r-l+1];}
int x,y,z,l,r,mid,ret;ll u,v,p,q,w;
int main(){
    scanf("%s%s",s+1,t+1);n=strlen(s+1);pw[0]=1ull;
    for(int i=1;i<=n;++i) h[i]=h[i-1]*mul+s[i],pw[i]=pw[i-1]*mul,ss[i]=s[i];
    for(int i=1;i<=n;++i){
        u=h[i],v=get(n-i+1,n);
        if(u==v){ck[i]=1;continue;}
        l=1,r=i-1,x=0;
        while(l<=r){
            mid=(l+r)>>1;
            if(h[mid]==get(n-i+1,n-i+mid)) x=mid,l=mid+1;
            else r=mid-1;
        }
        p=u+pw[i-x-1]*(t[x+1]-s[x+1]);
        q=v+(x+1>=n-i+1?pw[n-x-1]:0ull)*(t[x+1]-s[x+1]);
        if(p==q) cmax(ans[x+1],i);
        p=u+(n-i+x+1<=i?pw[i-(n-i+x+1)]:0ull)*(t[n-i+x+1]-s[n-i+x+1]);
        q=v+pw[i-x-1]*(t[n-i+x+1]-s[n-i+x+1]);
        if(p==q) cmax(ans[n-i+x+1],i);
    }
    x=0;
    for(int i=1;i<n;++i){
        if((i-1)*2<n) cmax(ans[i],x),cmax(ans[n-i+1],x);
        if(ck[i]) x=i;
    }
    for(int i=1;i<=n;++i) if(s[i]==t[i]) cmax(ans[i],x);
    for(int i=1;i<=n;++i) printf("%d\n",ans[i]);
    return 0;
}