#include <bits/stdc++.h>
//#define int long long
#define ll long long
#define db double
#define fi first
#define se second
#define pii pair<int,int>
#define vi vector<int>

using namespace std;

const int maxn=4e6; 
int n,m; 
char s[maxn+5],t[maxn+5],S[maxn+5]; 
int nxt[maxn+5],pans,mx[maxn+5],nxt2[maxn+5]; 
vector<int> G[maxn+5]; 
void dfs1(int u) {
	if (u!=m) { 
	cout<<u<<'\n';
		mx[u-m]=max(mx[u-m],u);
	}
	for (auto v:G[u]) dfs1(v); 
}
void dfs2(int u) {
	for (auto v:G[u]) {
		mx[v]=max(mx[v],mx[u]);
		dfs2(v);
	}
}
int main() {
//	freopen("in.txt","r",stdin); 
//		freopen("out.txt","w",stdout);  
	ios::sync_with_stdio(0);
	cin.tie(0); 
	cout.tie(0);
	while (cin>>(s+1)>>(t+1)) {
		n=strlen(s+1),m=strlen(t+1); 
		for (int i=1;i<=n;i++) S[i]=s[i];
		for (int i=1;i<=m;i++) S[i+n]=t[i];
		nxt[1]=0; 
		int p=0; 
		for (int i=2;i<=n+m;i++) {
			while (p && S[p+1]!=S[i]) p=nxt[p];
			if (S[p+1]==S[i]) p++;
			nxt[i]=p;
		}
		int x=n+m;
		while (x>min(n-1,m)) x=nxt[x]; 
		int pans=x; 
		if (n<m) {
			for (int i=0;i<=n-1;i++) {
				cout<<pans<<' ';
			}
			cout<<'\n'; 
			continue ; 
		}
		for (int i=0;i<=n;i++) {
			G[i].clear(); 
			mx[i]=0;
		}
		nxt[1]=0;
		p=0; 
		for (int i=2;i<=n;i++) {
			while (p && s[p+1]!=s[i]) p=nxt[p];
			if (s[p+1]==s[i]) p++;
			nxt[i]=p;
		}
		nxt2[1]=0;
		p=0;
		for (int i=2;i<=m;i++) {
			while (p&&t[p+1]!=t[i]) p=nxt2[p];
			if (t[p+1]==t[i]) p++;
			nxt2[i]=p; 
		}
		for (int i=1;i<n;i++) G[nxt[i]].push_back(i); 
		p=0; 
		for (int k=1;k<n;k++) {
			while (p && t[p+1]!=s[k]) p=nxt2[p];
			if (t[p+1]==s[k]) p++;
			if (p==m) {
				mx[k-m]=max(mx[k-m],k); 
			}
		}
		dfs2(0);
		for (int i=0;i<=n-1;i++) {
			cout<<max(pans,mx[i])<<' '; 
		}
		cout<<'\n'; 
	}
	return 0;
}