#include<bits/stdc++.h>
#define Gc() getchar()
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
#define all(x) x.begin(),x.end()
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;
const int N=2e5+5,M=5e4+5,K=1000+5,mod=998244353,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(263082);
#define Tp template<typename T>
#define Ts template<typename T,typename... Ar>
namespace Debug{
	Tp void _debug(char* f,T t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,T x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	#ifdef LOCAL
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
	#else 
	#define gdb(...) void()
	#endif
}using namespace Debug;
int n,m,k;char s[N],t[N],c[N];int ch;
namespace SA{
	struct node{int x,y,id;}A[N];
	int f[N],rk[N],sa[N];
	int hg[N],st[20][N];
	int LCP(int x,int y){
		if(x>n||y>m) return 0;
		x=rk[x];y=rk[y+n+1];if(x>y) swap(x,y);x++;
		int d=__lg(y-x+1);return min(st[d][x],st[d][y-(1<<d)+1]);
	}
	void build(){
		int i,j;Me(f,0);
		for(int i=1;i<=ch;i++) f[c[i]]++;
		for(int i=1;i<128;i++) f[i]+=f[i-1];
		for(int i=1;i<=ch;i++) rk[i]=f[c[i]];
		for(i=1;;i<<=1){
			for(int j=1;j<=ch;j++) A[j]=(node){rk[j],j+i<=ch?rk[j+i]:0,j};
			sort(A+1,A+ch+1,[](node x,node y){return x.x^y.x?x.x<y.x:x.y<y.y;});
			for(int j=1;j<=ch;j++) rk[A[j].id]=rk[A[j-1].id]+(A[j].x^A[j-1].x||A[j].y^A[j-1].y);
			if(rk[A[ch].id]==ch) break;
		}
		for(int i=1;i<=ch;i++) sa[rk[i]]=i;
		for(int i=1;i<=ch;i++) if(rk[i]^1){
			hg[rk[i]]=max(hg[rk[i-1]]-1,0);
			while(i+hg[rk[i]]<=ch&&c[i+hg[rk[i]]]==c[sa[rk[i]-1]+hg[rk[i]]]) hg[rk[i]]++;
		}
		for(int i=2;i<=ch;i++) st[0][i]=hg[i];
		for(int i=1;(1<<i)<=ch;i++){
			for(int j=2;j+(1<<i)-1<=ch;j++) st[i][j]=min(st[i-1][j],st[i-1][j+(1<<i-1)]);
		}
	}
}
int f[61],ans[61],g[61];
void Solve(){
	int i,j;scanf("%d%s%s",&k,s+1,t+1);
	n=strlen(s+1);m=strlen(t+1);
	copy(s+1,s+n+1,c+1);c[n+1]='#';copy(t+1,t+m+1,c+n+2);ch=n+m+1;
	SA::build();
	for(int i=1;i<=m;i++){
		Me(f,-0x3f);f[k]=0;
		for(int j=0;j<=k;j++){
			Mc(g,f);//g[k+j]=max(g[k+j],0);g[k-j]=max(g[k-j],j);
			for(int h=-k;h<=k;h++)if(g[h+k]>=0&&i-1+h+g[h+k]>=0){
				g[h+k]+=SA::LCP(g[h+k]+1,i-1+h+g[h+k]+1);
				if(h^k) f[h+k+1]=max(f[h+k+1],min(g[h+k],m-h-i));
				if(h^-k) f[h+k-1]=max(f[h+k-1],min(g[h+k],n-1)+1);
				if(g[h+k]<n) f[h+k]=max(f[h+k],min({g[h+k],n-1,m-h-i})+1);
			}
			for(int h=-k;h<=k;h++) if(g[h+k]>=n&&n+h>=1) ans[j]++;
		}
		// gdb(ans[0],ans[1],ans[2],ans[3],ans[4],i);
	}
	for(int i=0;i<=k;i++) printf("%d\n",ans[i]-(i?ans[i-1]:0));
}
int main(){
	int t=1;
	// scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}