#include <bits/stdc++.h>
#define db double
#define il inline
#define re register
#define ll long long
#define ui unsigned
#define ull ui ll
#define pii pair<int, int>
#define fi first
#define se second
#define eb emplace_back
#define SZ(v) (int)v.size()
#define ALL(v) v.begin(), v.end()
#define mems(v, x) memset(v, x, sizeof(v))
#define memc(a, b) memcpy(a, b, sizeof(a))
#define FOR(i, L, R) for(re int i = (L); i <= (R); ++i)
#define ROF(i, R, L) for(re int i = (R); i >= (L); --i)
#define LS i << 1, l, mid
#define RS i << 1 | 1, mid + 1, r
using namespace std;
#define N 400005
namespace sam {
  il int ch(char c) {
    if(isdigit(c)) return c & 15;
    if(c >= 'a' && c <= 'z') return 10 + c - 'a';
    return 10 + 26 + c - 'A';
  }
  int las, cnt, to[N][62], lnk[N], len[N], pos[N];
  il void insert(int c, int id) {
    int cur = ++cnt, p = las; len[pos[id] = las = cur] = len[p] + 1;
    while(~p && !to[p][c]) to[p][c] = cur, p = lnk[p];
    if(p == -1) return ; int q = to[p][c];
    if(len[p] + 1 == len[q]) {lnk[cur] = q; return ;}
    int cl = ++cnt; memc(to[cl], to[q]), lnk[cl] = lnk[q], len[cl] = len[p] + 1;
    while(~p && to[p][c] == q) to[p][c] = cl, p = lnk[p]; lnk[cur] = lnk[q] = cl;
  }
  vector<int> e[N];
  int dfn, id[N], st[20][N];
  il int dmin(int a, int b) {return id[a] < id[b] ? a : b;}
  il void dfs(int x, int f = -1) {
    // cout << f << " " << x << "\n";
    st[0][id[x] = ++dfn] = f;
    for(auto y : e[x]) dfs(y, x);
  }
  il int LCA(int x, int y) {
    if(x == y) return x; if((x = id[x]) > (y = id[y])) swap(x, y);
    int t = __lg(y - x++); return dmin(st[t][x], st[t][y - (1 << t) + 1]);
  }
  il void build(string s) {
    // cout << s << "\n";
    reverse(ALL(s));
    lnk[0] = -1; FOR(i, 0, SZ(s) - 1) insert(ch(s[i]), i);
    reverse(pos, pos + SZ(s));
    // FOR(i, 0, SZ(s) - 1) cout << pos[i] << " \n"[i == SZ(s) - 1];
    FOR(i, 1, cnt) e[lnk[i]].eb(i); dfs(0);
    FOR(i, 1, 19) FOR(j, 1, dfn - (1 << i) + 1)
      st[i][j] = dmin(st[i - 1][j], st[i - 1][j + (1 << i - 1)]);
  }
  il int LCP(int x, int y) {
    // cout << pos[x] << " " << pos[y] << "\n";
    // cout << LCA(pos[x], pos[y]) << "\n";
    return len[LCA(pos[x], pos[y])];}
}
int n, m, K, ans[N];
int tmpdp[N], *dp = tmpdp + 100, tmpndp[N], *ndp = tmpndp + 100;
il int LCP(int a, int b) {if(b >= m) return a; return min(a + sam::LCP(a, b + n), n);}
il void solve(int p) {
  FOR(i, -K - 1, K + 1) dp[i] = -1e9;
  FOR(t, 0, K) {
    FOR(i, -t, t) ndp[i] = max(dp[i] + 1, max(dp[i - 1], dp[i + 1] + 1));
    FOR(i, -t, t) dp[i] = min(ndp[i], n); if(!t) dp[0] = 0;
    FOR(i, -t, t) if(dp[i] >= 0 && dp[i] < n) {
      // cout << p << " = " << dp[i] << ", " << dp[i] + i + p << ", " << LCP(dp[i], dp[i] + p + i) << "\n";
      dp[i] = LCP(dp[i], dp[i] + i + p);
    }
    FOR(i, -t, t) if(i + n > 0 && i + n + p <= m && dp[i] == n) ++ans[t];
  }
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0), cout.tie(0);
  string s, t;
  cin >> K >> s >> t, n = SZ(s), m = SZ(t);
  sam::build(s + t);
  FOR(i, 0, m - n + K) solve(i);
  FOR(i, 0, K) cout << ans[i] - (i ? ans[i - 1] : 0) << "\n";
  cerr << 1.0 * clock() / CLOCKS_PER_SEC;
  return 0;
}