#include<map>
#include<set>
#include<queue>
#include<deque>
#include<cmath>
#include<ctime>
#include<bitset>
#include<vector>
#include<cstdio>
#include<string>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<unordered_map>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned int uint;
typedef unsigned long long ull;
#define mkp make_pair
#define lb lower_bound
#define ub upper_bound
#define eb emplace_back
#define fs fflush(stdout)
#define ump unordered_map
#define pq priority_queue
#define clz __builtin_clz
#define ctz __builtin_ctz
#define space putchar(' ')
#define enter putchar('\n')
#define sz(x) (int)x.size()
#define np next_permutation
#define clzl __builtin_clzll
#define par __builtin_parity
#define ctzl __builtin_ctzll
#define ppc __builtin_popcount
#define parl __builtin_parityll
#define all(x) x.begin(),x.end()
#define ppcl __builtin_popcountll
#define ms(x,y) memset(x,y,sizeof(x))
#define debug(x) cerr<<#x<<"= "<<(x)<<'\n'
template<class T> inline T &read(T &x){
	x=0;int f=1;char ch=getchar();
	while(ch<48||ch>57){if(ch=='-') f=-f;ch=getchar();}
	while(ch>=48&&ch<=57) x=(x<<1)+(x<<3)+(ch^48),ch=getchar();
	return x*=f;
}
template<class T> inline void print(T x){
	static char buf[40];static int cnt=0;
	if(x<0) putchar(45),x=-x;
	do buf[++cnt]=x%10^48;while(x/=10);
	do putchar(buf[cnt--]);while(cnt);
}
#define mod 998244353
#define inf 0x3f3f3f3f
#define fpi freopen("","r",stdin)
#define fpo freopen("","w",stdout)
int nxts[1000005],nxtt[1000005],ans[1000005],fail[1000005],nxttt[2000005];
char s[1000005],t[1000005],tt[2000005];
void getnxt(int *nxt,char *w,int len){
	int now=0,i;
	for(i=2;i<=len;i++){
		while(now&&w[now+1]^w[i]) now=nxt[now];
		nxt[i]=now+=w[now+1]==w[i];
	}
}
void solve(){
	int i,lens=strlen(s+1),lent=strlen(t+1),now=0;
	for(i=0;i<lens;i++) ans[i]=0;
	strcpy(tt+1,s+1),strcpy(tt+lens+1,t+1);
	getnxt(nxts,s,lens),getnxt(nxtt,t,lent),getnxt(nxttt,tt,lens+lent);
	while(nxttt[lens+lent]>=min(lens,lent+1)) nxttt[lens+lent]=nxttt[nxttt[lens+lent]]; 
	for(i=1;i<=lens;i++){
		while(now&&t[now+1]^s[i]) now=nxtt[now];
		fail[i]=now+=s[i]==t[now+1];
		if(now==lent) now=nxtt[now];
	}
	for(i=1;i<lens;i++) if(fail[i+lent]==lent&&i<lens-lent) ans[i]=i+lent;else ans[i]=ans[nxts[i]];
	for(i=0;i<lens;i++) print(max(ans[i],nxttt[lens+lent])),space;enter;
}
int main(){
	while(~scanf("%s%s",s+1,t+1)) solve();
	return 0;
}