#include<bits/stdc++.h>
using namespace std;
const int BS=1<<20;
char buf1[BS],*P3=buf1;
inline void flush(){
    fwrite(buf1,1,P3-buf1,stdout);
    P3=buf1;
}
inline void pc(char c){
    *(P3++)=c;
    if(P3==buf1+BS)flush();
}
inline void out(int x){
    static int st[10],tp;
    if(x<0)pc('-'),x=-x;
    if(!x)pc('0');
    while(x)st[++tp]=x%10,x/=10;
    while(tp)pc(st[tp]+'0'),tp--;
}
const int N=1e6+5,mod=1e9+7;
inline int add(int a,int b){return a+b>=mod?a+b-mod:a+b;}
inline int mul(int a,int b){return 1ll*a*b%mod;}
int n,m;
char s[N],t[N];
int fail[N],ans[N],fail1[N];
int main(){
	while(scanf("%s",s+1)!=EOF){
		scanf("%s",t+1);
		n=strlen(s+1),m=strlen(t+1);
		for(int i=2,j=0;i<=n;i++){
			while(j&&s[j+1]!=s[i])j=fail[j];
			if(s[j+1]==s[i])j++;
			fail[i]=j;
		}
		s[n]='A';int p=0;
		for(int i=1,j=0;i<=m;i++){
			while(p&&s[p+1]!=t[i])p=fail[p];
			if(s[p+1]==t[i])p++;
		}
		for(int i=0;i<=n;i++)ans[i]=0;
		ans[0]=p;
		for(int i=2,j=0;i<=m;i++){
			while(j&&t[j+1]!=t[i])j=fail1[j];
			if(t[j+1]==t[i])j++;
			fail1[i]=j;
		}
		for(int i=1,j=0;i<n;i++){
			while(j&&t[j+1]!=s[i])j=fail1[j];
			if(t[j+1]==s[i])j++;
			if(j==m)ans[i-m]=max(ans[i-m],i);
		}
		for(int i=1;i<n;i++)ans[i]=max(ans[i],ans[fail[i]]);
		for(int i=0;i<n;i++)out(ans[i]),pc(' ');
		pc('\n');
	}
	flush();
	return 0;
}