#include<bits/stdc++.h>
using namespace std;
using llt=long long;
using ull=unsigned long long;
const llt N=2000100;const ull Base=13331;
llt z[N],n,ans[N],P,Q,L,maxx;char s[N],t[N];ull S[N],pw[N];
ull F(llt id){if(id>=P)   return S[id]-s[P]*pw[id-P]+Q*pw[id-P];return S[id];}
bool check(llt A,llt B,char U){Q=U,P=B;return (F(A)==F(n)-F(n-A)*pw[A]);}
int main()
{
    #ifdef LOCAL
        freopen("1.in","r",stdin);
        freopen("1.out","w",stdout);
    #endif
    scanf("%s%s",s+1,t+1);n=strlen(s+1);z[1]=0;
    for(llt i=2,r=1,l=1;i<=n;i++)
    {
        if(i<=r)    z[i]=min(z[i-l+1],r-i+1); 
        while(s[i+z[i]]==s[z[i]+1]&&i+z[i]<=n)   z[i]++;
        if(i+z[i]-1>r)  r=i+z[i]-1,l=i;
    }
    pw[0]=1;for(int i=1;i<=n;i++)   pw[i]=pw[i-1]*Base;
    for(int i=1;i<=n;i++)   S[i]=S[i-1]*Base+s[i];
    L=n/2;
    for(llt i=n-1;i>=1;i--)
    {
        if(z[n-i+1]>=i)  
        {
            for(int j=L;j>i;j--)    ans[j]=max(i,ans[j]);
            for(int j=n-L;j<=n-i;j++)    ans[j]=max(i,ans[j]);
            if(i<L)L=i;maxx=max(i,maxx);continue;
        }
        if(check(i,z[n-i+1]+n-i+1,t[z[n-i+1]+n-i+1]))
            ans[z[n-i+1]+n-i+1]=max(ans[z[n-i+1]+n-i+1],i);
        if(check(i,z[n-i+1]+1,t[z[n-i+1]+1]))
            ans[z[n-i+1]+1]=max(ans[z[n-i+1]+1],i);
    }
    for(int i=1;i<=n;i++)   if(s[i]==t[i])  ans[i]=max(ans[i],maxx);
    for(int i=1;i<=n;i++)   printf("%lld\n",ans[i]);
    return 0;
}