/*
想了好久竟然忘了hash...
看到字符串题一定要想哈希啊！
(因为别的算法要么是一眼的板子要么很难)
*/
#include<bits/stdc++.h>
using namespace std;
const int N=2e6+10,base=131,mod=1e9+7;
char s[N],t[N];
int n,x,fl,pw[N],h[N],ok[N],ans[N];
int query(int l,int r,int p)
{
    int sum=1ll*(h[r]+mod-1ll*h[l-1]*pw[r-l+1]%mod)%mod;
    if(l<=p&&p<=r)sum=1ll*(sum+mod+1ll*(t[p]-s[p])*pw[r-p]%mod)%mod;
    return sum;
}
int main()
{
    pw[0]=1;
    for(int i=1;i<=N-10;i++)pw[i]=1ll*pw[i-1]*base%mod;
    scanf("%s",s+1);
    scanf("%s",t+1);
    n=strlen(s+1);
    for(int i=1;i<=n;i++)if(s[i]==t[i])fl=1;
    for(int i=1;i<=n;i++)h[i]=1ll*(1ll*h[i-1]*base%mod+(s[i]-'a'))%mod;
    for(int i=1;i<n;i++)
    {
        if(query(1,i,0)==query(n-i+1,n,0)){ok[i]=1;continue;}
        int l=0,r=i;
        while(l<r)
        {
            int mid=l+r+1>>1;
            if(query(1,mid,0)==query(n-i+1,n-i+mid,0))l=mid;
            else r=mid-1;
        }
        if(query(1,i,l+1)==query(n-i+1,n,l+1))ans[l+1]=max(ans[l+1],i);
        if(query(1,i,n-i+l+1)==query(n-i+1,n,n-i+l+1))ans[n-i+l+1]=max(ans[n-i+l+1],i);
    }
    for(int i=1;i<n;i++)
    {
        if((i-1)*2<n)ans[i]=max(ans[i],x),ans[n-i+1]=max(ans[n-i+1],x);
        if(ok[i])x=i;
    }
    for(int i=1;i<=n;i++)if(s[i]==t[i])ans[i]=x;
    for(int i=1;i<=n;i++)printf("%d\n",ans[i]);
    return 0;
}