// MagicDark
#include <bits/stdc++.h>
#define debug cerr << "\033[33m[" << __LINE__ << "]\033[0m "
#define SZ(x) (int) x.size() - 1
#define all(x) x.begin(), x.end()
#define ms(x, y) memset(x, y, sizeof x)
#define F(i, x, y) for (int i = (x); i <= (y); i++)
#define DF(i, x, y) for (int i = (x); i >= (y); i--)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
template <typename T> T& chkmax(T &x, T y) {return x = max(x, y);}
template <typename T> T& chkmin(T &x, T y) {return x = min(x, y);}
template <typename T> T& read(T &x) {
	x = 0; int f = 1; char c = getchar();
	for (; !isdigit(c); c = getchar()) if (c == '-') f = -f;
	for (; isdigit(c); c = getchar()) x = (x << 1) + (x << 3) + (c ^ 48);
	return x *= f;
}
const int N = 2e5 + 10;
int lg(int x) {return 31 ^ __builtin_clz(x);}
int n, m, k;
string s, t;
namespace SA {
int n, cnt[N], rk[N], w[N], sa[N], m = 256, height[N], minn[21][N];
void qsort() {
	F(i, 1, m) cnt[i] = 0;
	F(i, 1, n) cnt[rk[i]]++;
	F(i, 1, m) cnt[i] += cnt[i - 1];
	DF(i, n, 1) sa[cnt[rk[w[i]]]--] = w[i];
}
void SA(string st) {
	n = st.size();
	st = ' ' + st;
	F(i, 1, n) rk[i] = st[i], w[i] = i;
	qsort();
	// F(i, 1, n) cout << sa[i] << " "; cout << endl;
	for (int len = 1; len <= n; len <<= 1) {
		int tot = 0;
		F(i, n - len + 1, n) w[++tot] = i;
		F(i, 1, n)
			if (sa[i] > len) w[++tot] = sa[i] - len;
		qsort();
		swap(w, rk);
		m = 0;
		F(i, 1, n) {
			if (w[sa[i]] != w[sa[i - 1]] || w[sa[i] + len] != w[sa[i - 1] + len]) m++;
			rk[sa[i]] = m;
		}
		if (m == n) break;
	}
	int lcp = 0;
	st += '#';
	// debug << st << endl;
	F(i, 1, n) {
		if (rk[i] == 1) continue;
		if (lcp) lcp--;
		while (st[i + lcp] == st[sa[rk[i] - 1] + lcp]) lcp++;
		height[rk[i]] = lcp;
	}
	F(i, 0, lg(n))
		F(j, 1, n - (1 << i) + 1)
			if (i) minn[i][j] = min(minn[i - 1][j], minn[i - 1][j + (1 << (i - 1))]);
			else minn[i][j] = height[j];
}
int lcp(int x, int y) {
	x = rk[x], y = rk[y];
	if (x > y) swap(x, y);
	int k = lg(y - x++);
	return min(minn[k][x], minn[k][y - (1 << k) + 1]);
}
}
int qq(int x, int y) {
	if (x > n || y > m) return 0;
	return min(n - x + 1, SA::lcp(x, n + y));
}
int dp[35][65], ans[35];
signed main() {
	cin.tie(0) -> sync_with_stdio(0); // don't use puts
	cin >> k >> t >> s;
	n = s.size(), m = t.size();
	SA::SA(s + t);
	// debug << SA::lcp(1, 2) << endl;
	// return 0;
	// while (true) {
	// 	int x, y; cin >> x >> y;
	// 	cout << qq(x, y) << '\n';
	// }
	F(be, 1, n) {
		ms(dp, -0x3f);
		dp[0][30] = qq(be, 1);
		F(i, 0, k - 1)
			F(j, - i, i) if (dp[i][j + 30] >= 0) {
				// if (be + j + dp[i][j + 30] > n) continue;
				// if (1 + dp[i][j + 30] > m) continue;
				auto work = [&] (int val) {
					if (val < -j) return;
					if (be + j + val <= n && 1 + val <= m) chkmax(dp[i + 1][j + 30], val + 1 + qq(be + j + 1 + val, 1 + 1 + val));
					if (be + j + val <= n) chkmax(dp[i + 1][j + 1 + 30], val + qq(be + j + 1 + val, 1 + val));
					if (1 + val <= m) chkmax(dp[i + 1][j - 1 + 30], val + 1 + qq(be + j + val, 1 + 1 + val));
				};
				work(dp[i][j + 30]);
				if (dp[i][j + 30]) work(dp[i][j + 30] - 1);
				if (dp[i][j + 30] >= 2) work(dp[i][j + 30] - 2);
			}
		// debug << dp[2][- 2 + 30] << endl;
		F(j, -k, k)
			F(i, 0, k)
				if (1 + dp[i][j + 30] > m) {
					int l = be, r = be + j + dp[i][j + 30] - 1;
					// debug << l << " " << r << " " << s.substr(l - 1, r - l + 1) << " " << i << endl;
					// debug << be << " " << i << " " << j << " " << dp[i][j + 30] << endl;
					if (l <= r ) ans[i]++;
					break;
				}
		// if (be == 1) {
		// 	debug << dp[0][30] << endl;
		// }
	}
	F(i, 0, k) cout << ans[i] << '\n';
	return 0;
}
/* why?
*/