#include<bits/stdc++.h>

#define vc vector
#define pb emplace_back
#define pii pair<int, int>
#define mkp make_pair
#define rep(i, a, b) for(int i = (a); i <= (b); ++i)
#define lep(i, a, b) for(int i = (a); i >= (b); --i)

using namespace std;

mt19937 gen(time(0));

inline int read() {
	int x = 0, w = 0; char ch = getchar(); while(!isdigit(ch)) w |= (ch == '-'), ch = getchar();
	while(isdigit(ch)) x = x * 10 + (ch ^ 48), ch = getchar(); return w ? -x : x; 
}

const int N = 2e5 + 5, K = 35, LOG = 17, inf = 1e9;

inline void chkmax (int &x, int y) { x = x < y ? y : x; }
inline void chkmin (int &x, int y) { x = x > y ? y : x; }

int k, lens, lent, pos[K], f[K][K << 1];
int val[N], ans[K];
char S[N], T[N], str[N];

inline int& dp (int x, int y) { return f[x][K + y]; }

namespace sa {
	int rk[N], sa[N], fi[N], se[N], buc[N], mx, idx, fl, n;
	int lg[N], st[LOG][N];
	inline void round (int *a) {
		mx = 0; 
		rep (i, 1, n) mx = max (mx, a[i]);
		rep (i, 0, mx) buc[i] = 0;
		rep (i, 1, n) ++buc[a[i]];
		rep (i, 1, mx) buc[i] += buc[i - 1];
		lep (i, n, 1) rk[sa[i]] = buc[a[sa[i]]]--;
		rep (i, 1, n) sa[rk[i]] = i;
	}
	inline void basesort () {
		rep (i, 1, n) rk[i] = sa[i] = i; idx = 0;
		round (se); round (fi);
		rep (i, 1, n) rk[sa[i]] = (fi[sa[i]] == fi[sa[i - 1]] && se[sa[i]] == se[sa[i - 1]]) ? idx : ++idx;
		fl |= idx == n;
	}
	inline void suffix_sort (char *str, int nn) {
		mx = fl = 0; n = nn;
		rep (i, 1, n) mx = max (mx, (int)str[i]);
		rep (i, 0, mx) buc[i] = 0;
		rep (i, 1, n) buc[str[i]] = 1;
		rep (i, 1, mx) buc[i] += buc[i - 1];
		rep (i, 1, n) rk[i] = buc[str[i]];
		for (int m = 1; m < n && !fl; m <<= 1) {
			rep (j, 1, n) fi[j] = rk[j], se[j] = j + m > n ? 0 : rk[j + m];
			basesort ();
		}
		for (int i = 1, j = 0, k = 0; i <= n; i++) {
			if (k) --k; j = sa[rk[i] - 1];
			while (str[i + k] == str[j + k]) ++k;
			st[0][rk[i]] = k;
		}
		
		lg[1] = 0; rep (i, 2, n) lg[i] = lg[i >> 1] + 1; 
		rep (i, 1, LOG - 1) for (int j = 1; j + (1 << i) - 1 <= n; j++) 
			st[i][j] = min (st[i - 1][j], st[i - 1][j + (1 << i - 1)]);
	}
	inline int lcp (int x, int y) {
		x = rk[x]; y = rk[y + lens + 1];
		if (x > y) swap (x, y); ++x;
		int k = lg[y - x + 1];
		return min (st[k][x], st[k][y - (1 << k) + 1]);
	}
}
using namespace sa;

inline void init () {
	rep (i, 1, lens) str[i] = S[i];
	rep (i, 1, lent) str[lens + 1 + i] = T[i];
	str[lens + 1] = '@'; str[lens + lent + 2] = '#';
	suffix_sort (str, lens + lent + 2);
}

signed main() {
	k = read();
	
	scanf ("%s", S + 1); lens = strlen (S + 1);
	scanf ("%s", T + 1); lent = strlen (T + 1);
	init ();
	
	rep (st, 0, lent - 1) {
		rep (i, 0, k) rep (j, -k, k) dp (i, j) = -inf;
		dp (0, 0) = 0;
		rep (i, 0, k) rep (j, -i, i) if (dp (i, j) != -inf) {
			dp (i, j) += lcp (dp (i, j) + 1, st + dp (i, j) + j + 1);
			if (i < k) {
				chkmax (dp (i + 1, j + 1), dp (i, j));
				chkmax (dp (i + 1, j - 1), dp (i, j) + 1);
				chkmax (dp (i + 1, j), dp (i, j) + 1);
			}
		}
		int L = max (st + 1, st + lens - k), R = min (lent, st + lens + k);
		if (L > R) continue;
		rep (i, L, R) val[i] = k + 1;
		rep (i, 0, k) rep (j, -i, i) if (dp (i, j) >= lens)
			chkmin (val[min (lent, st + lens + j)], i);
		rep (i, L, R) if (val[i] <= k) ++ans[val[i]];
	}
	
	rep (i, 0, k) printf ("%d\n", ans[i]);
	
	return 0;
}