#include <bits/stdc++.h>
#define il inline
using namespace std;
typedef unsigned long long ull;
il void cmax(int &x,int y){x=x>y?x:y;}
const ull mul=131;
const int N=2e6+5;
int n,len,mx[N];char s[N],t[N];ull h[N],pw[N];int ans[N];
il ull get(int l,int r){return h[r]-h[l-1]*pw[r-l+1];}
int l,r,mid,ret;ull u,v,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;
    for(int i=n-1;i;--i) if(get(1,i)==get(n-i+1,n)){len=i;break;}
    for(int i=1;i<=n;++i) mx[i]=max(mx[i-1],i*(get(1,i)==get(n-i+1,n)));
    for(int i=1;i<=n;++i) if(s[i]==t[i]) ans[i]=len;
    for(int i=1;i<=n;++i) cmax(ans[i],mx[min(i-1,n-i)]);
    for(int i=1;i<n;++i){
        l=1,r=i,ret=0;
        while(l<=r){
            mid=(l+r)>>1;
            if(get(1,mid)==get(n-i+1,n-i+mid)) ret=mid,l=mid+1;
            else r=mid-1;
        }
        if(ret==i) continue;
        u=get(1,i)+(t[ret+1]-s[ret+1])*pw[i-ret-1];
        if(ret+1>=n-i+1) v=get(n-i+1,n)+(t[ret+1]-s[ret+1])*pw[n-ret-1];else v=get(n-i+1,n);
        if(u==v) cmax(ans[ret+1],i);
        if(n-i+ret+1<=i) u=get(1,i)+(t[n-i+ret+1]-s[n-i+ret+1])*pw[i-(n-i+ret+1)];else u=get(1,i);
        v=get(n-i+1,n)+(t[n-i+ret+1]-s[n-i+ret+1])*pw[n-(n-i+ret+1)];
        if(u==v) cmax(ans[n-i+ret+1],i);
    }
    for(int i=1;i<=n;++i) printf("%d\n",ans[i]);
    return 0;
}