#include<bits/stdc++.h>
using namespace std;
#define IOS {cin.tie(0);cout.tie(0);ios::sync_with_stdio(0);}
#define rep(i,l,r) for(int i=(l); i<=(r); i++)
#define per(i,r,l) for(int i=(r); i>=(l); i--)
#define P pair<int,int>
#define ll long long
#define vi vector<int>
const int N=2e6+6;
const ll mod=(ll)1e18+3,bs=131;
ll mul(ll a,ll b){
    return (__int128)a*b%mod;
    ll tmp=(a*b-(ll)((long double)a/mod*b+0.5)*mod);
    return tmp<0?tmp+mod:tmp;
}
char s[N],t[N];
ll hs[N],ht[N],pw[N];
int n,m,bor[N],ok[N],dp[N];
vi tu[N];
void bu(char *s,ll *h,int n){
    rep(i,1,n)h[i]=(mul(h[i-1],bs)+s[i])%mod;
}
ll qu(ll *h,int l,int r){
    --l;
    ll res=h[r]-mul(h[l],pw[r-l]);
    if(res<0)res+=mod; return res;
}
void dfs(int now){
    if(ok[now])dp[now]=now;
    for(int son:tu[now]){
        dp[son]=dp[now];
        dfs(son);
    }
}
void slv(){
    n=strlen(s+1),m=strlen(t+1);
    if(n==1){cout<<"0\n";return;}
    bu(s,hs,n); bu(t,ht,m);
    int ma=0;
    rep(len,1,min(n-1,m)){
        if(qu(hs,1,len)==qu(ht,m-len+1,m))ma=len;
    }
    // cout<<ma<<endl; return;
    int len=0;
    rep(i,2,n){
        while(len && s[len+1]!=s[i])len=bor[len];
        len+=s[len+1]==s[i]; bor[i]=len;
    }
    rep(i,0,n)tu[i].clear(),ok[i]=0;
    rep(i,1,n)tu[bor[i]].push_back(i); //cout<<bor[i]<<" ";
    ll tmp=qu(ht,1,m);
    rep(i,1,n){
        if(i+m>n-1)break;
        if(qu(hs,i+1,i+m)==tmp)ok[i]=1;
    }
    dfs(0);
    rep(i,0,n-1){
        int ans=ma;
        if(dp[i])ans=max(dp[i]+m,ans);
        printf("%d ",ans);
    }
    printf("\n");
}
signed main(){
    pw[0]=1; rep(i,1,1e6)pw[i]=mul(pw[i-1],bs);
    while(scanf("%s%s",s+1,t+1)!=EOF){
        slv();
    }
}
/*
aaa
a
ababa
a
ab
cd

*/