#include<bits/stdc++.h>
using namespace std;
inline int qread()
{
    int a=0,f=1;char ch=getchar();
    while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
    while(isdigit(ch)){(a*=10)+=(ch^48);ch=getchar();}
    return a*f;
}
int K,n,m,len,ans[100],dp[100][100],mn[100];
char S[100010],T[100010];
int sa[200010],rk[200010],a[200010],val[200010],tp,h[200010],st[18][200010];
inline void ssort()
{
    memset(val,0,(tp+1)<<2);
    for(int i=1;i<=len;++i)++val[rk[i]];
    for(int i=1;i<=tp;++i)val[i]+=val[i-1];
    for(int i=len;i;--i)sa[val[rk[a[i]]]--]=a[i];
    return ;
}

inline int LCP(int x,int y)
{
    if(x>n||y>m)return 0;
    int px=rk[x],py=rk[n+y];
    if(px>py)swap(px,py);
    int s=31-__builtin_clz(py-px++);
    return min({st[s][px],st[s][py-(1<<s)+1],n-x+1});
}
signed main()
{
    K=qread();
    scanf("%s%s",S+1,T+1);
    len=n=strlen(S+1),m=strlen(T+1);
    for(int i=1;i<=m;++i)S[++len]=T[i];
    for(int i=1;i<=len;++i)rk[i]=S[i],a[i]=i;
    tp=max(n,128);ssort();
    for(int i=1,p=0;i<len;i<<=1,tp=p)
    {
        p=0;for(int j=i;j;--j)a[++p]=len-i+j;
        for(int j=1;j<=len;++j)if(sa[j]>i)a[++p]=sa[j]-i;
        ssort();memcpy(a,rk,(len+1)<<2);p=0;
        for(int j=1;j<=len;++j)rk[sa[j]]=(a[sa[j]]^a[sa[j-1]]||a[sa[j]+i]^a[sa[j-1]+i])?++p:p;
    }
    for(int i=1;i<=len;++i)rk[sa[i]]=i;
    for(int i=1,j,k=0;i<=len;++i)
    {
        if(rk[i]==1)continue;
        if(k)--k;j=sa[rk[i]-1];
        while(i+k<=len&&j+k<=len&&S[i+k]==S[j+k])++k;
        h[rk[i]]=k;st[0][rk[i]]=k;
    }
    for(int i=1;i<=17;++i)for(int j=1;j+(1<<i)-1<=len;++j)st[i][j]=min(st[i-1][j],st[i-1][j+(1<<(i-1))]);
    for(int l=1;l<=m&&l+n-K-1<=m;++l)
    {
        for(int i=0;i<=K;++i)memset(dp[i],-63,(K<<1|1)<<3);
        memset(mn,-1,(K<<1|1)<<2);dp[0][K]=LCP(1,l);
        for(int i=0,A,B;i<=K;++i)for(int j=-i;j<=i;++j)if(dp[i][j+K]>=0)
        {
            A=dp[i][j+K];B=l+A+j-1;
            if(A==n&&!~mn[j+K])mn[j+K]=i;
            if(i==K)continue;
            dp[i+1][j+K]=max(dp[i+1][j+K],A<n&&B<m?A+LCP(A+2,B+2)+1:A);
			dp[i+1][j+K-1]=max(dp[i+1][j+K-1],A<n?A+LCP(A+2,B+1)+1:(A+j>0?A:-1000000000));
			dp[i+1][j+K+1]=max(dp[i+1][j+K+1],B<m?A+LCP(A+1,B+2):(A>0?A-1:-1000000000));
        }
        for(int i=max(-K,1-n);i<=K;++i)if(~mn[i+K])++ans[mn[i+K]];
    }
    for(int i=0;i<=K;++i)printf("%d\n",ans[i]);
	return 0;
}