#include <bits/stdc++.h>

const int N = 2e6 + 5;
using std::vector;
char s[N], t[N], m[N];
int tag[N], nxtm[N], nxts[N], nxtt[N], sn, tn, mn;
vector<int> e[N];

inline void KMP(char *s, int *nxt, int len)
{
	for (int i = 2, j = 0; i <= len; ++i)
	{
		while (j > 0 && s[j + 1] != s[i])
			j = nxt[j];
		if (s[j + 1] == s[i])
			++j;
		nxt[i] = j;
	}
}

template <class T>
inline void CkMax(T &x, T y) {x < y ? x = y : 0;}

inline void dfs(int x)
{
	for (int y : e[x])
	{
		CkMax(tag[y], tag[x]);
		dfs(y);
	}	
}

int main()
{
	while (scanf("%s%s", s + 1, t + 1) != EOF)
	{
		sn = strlen(s + 1);
		tn = strlen(t + 1);
		mn = sn + tn; 
		for (int i = 1; i <= sn; ++i)
			m[i] = s[i];
		for (int i = 1; i <= tn; ++i)
			m[sn + i] = t[i];
		KMP(m, nxtm, mn);
		KMP(s, nxts, sn);
		KMP(t, nxtt, tn);
		int ans = nxtm[mn];
		while (ans >= sn || ans > tn)
			ans = nxtm[ans];
		for (int i = 1; i <= sn; ++i)
			e[nxts[i]].emplace_back(i);
		for (int i = 1, j = 0; i < sn; ++i)
		{
			while (j > 0 && t[j + 1] != s[i])
				j = nxtt[j];
			if (t[j + 1] == s[i])
				++j;
			if (j == tn)
			{
				if (i - tn > 0)
				CkMax(tag[i - tn], i);
				j = nxtt[j];
		//		printf("%d\n", i);
			}
		}
		dfs(0);
		
	//	printf("?%d\n", tag[1]);
		printf("%d ", ans);
		for (int i = 1; i < sn; ++i)
			printf("%d ", std::max(tag[i], ans));
		putchar('\n');
		
		for (int i = 0; i <= mn; ++i)
			tag[i] = nxts[i] = nxtt[i] = nxtm[i] = 0;
		for (int i = 0; i <= sn; ++i)
			e[i].clear();
	}	
}