//Shirasu Azusa 2024.09
#include<bits/stdc++.h>
#define fi first
#define se second
#define eb emplace_back
#define mp make_pair
using namespace std;
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef __int128 i128;
template<typename T,typename U>
T ceil(T x, U y) {return (x>0?(x+y-1)/y:x/y);}
template<typename T,typename U>
T floor(T x, U y) {return (x>0?x/y:(x-y+1)/y);}
template<class T,class S>
bool chmax(T &a,const S b) {return (a<b?a=b,1:0);}
template<class T,class S>
bool chmin(T &a,const S b) {return (a>b?a=b,1:0);}
int popcnt(int x) {return __builtin_popcount(x);}
int popcnt(ll x)  {return __builtin_popcountll(x);}
int topbit(int x) {return (x==0?-1:31-__builtin_clz(x));}
int topbit(ll x)  {return (x==0?-1:63-__builtin_clzll(x));}
int lowbit(int x) {return (x==0?-1:__builtin_ctz(x));}
int lowbit(ll x)  {return (x==0?-1:__builtin_ctzll(x));}

#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<pii> vp;
typedef tuple<int,int,int> tiii;
int read() {
	int x=0,w=1; char c=getchar(); 
	while(!isdigit(c)) {if(c=='-') w=-1; c=getchar();}
	while(isdigit(c)) {x=x*10+(c-'0'); c=getchar();} 
	return x*w;    
}

const int N=205,mod=1e9+7;
int sx[N][N*2][N],sy[N][N][N],n,ct,rt,t[N],ans[N],r[N];
int f[N][N][N], g[N][N][N];

inline int pls(int x,int y) {return (x+y>=mod?x+y-mod:x+y);}
inline int mns(int x,int y) {return (x<y?x-y+mod:x-y);}

void getss(int i) {
	if(i) {
		rep(j,0,n) rep(e,0,n-j) {
			int lim=((i-1)==0?n:min((j+e)/(i-1),n));
			rep(d,0,lim) sx[j][e+j][d]=sy[j][e][d]=0;
		}
	}
	rep(j,1,n) rep(e,0,n-j) {
		int lim=(i==0?n:min((j+e)/i,n));
		rep(d,0,lim) {
			sx[j][e+j][d]=pls(sx[j-1][e+j][d],f[j][e][d]);
		}
		rep(d,0,lim) {
			sy[j][e][d]=pls((d==0?0:sy[j-1][e][d-1]),f[j][e][d]);
		}
	}
}
int qx(int i,int j,int e,int d,int l,int r) {
	if(l>r) return 0; int jl=j-r, jr=j-l;
	int sl=(jl==0?0:sx[jl-1][e+j-d][d]);
	int sr=sx[jr][e+j-d][d];
	return mns(sr,sl);
}
int qy(int i,int j,int e,int d,int l,int r) {
	if(l>r) return 0; 
	int jl=j-r, jr=j-l, dl=2*d-r, dr=2*d-l;
	int sl=(jl==0||dl==0?0:sy[jl-1][e][dl-1]);
	int sr=sy[jr][e][dr];
	return mns(sr,sl);
}

signed main() {
	n=read(), ct=read();
	rep(i,1,ct) t[read()]++;
	if(!t[0]) t[0]=1, ct++;
	rep(i,0,n) rt+=(t[i]!=0);

	g[n+1][0][0]=1;
	per(i,n,0) {
		static int s[N]; rep(k,0,n) s[k]=0;
		rep(j,t[i],n) {
			rep(k,0,n) {
				if(t[i]==0) g[i][j][k]=g[i+1][j][k];
				if(k!=0&&j>=max(t[i],1)) {
					int nj=j-max(t[i],1);
					s[k]=pls(s[k],g[i+1][nj][k-1]);
					g[i][j][k]=pls(g[i][j][k],s[k]);
				}
			}
		}
	}

	rep(j,t[0],n) rep(e,0,n) rep(d,0,n) f[j][e][d]=(j+e>=d);
	if(!t[1]) {
		int m=1; rep(k,1,n) rep(p,k-m,n) {
			int q=k-m; if(p<q) continue;
			ans[k]=(ans[k]+1ll*g[m+1][p][q]*f[n-p][p-q][1])%mod;
		}
	}
	getss(0);

	rep(i,1,n) {
		rep(j,1,n) {
			rep(e,0,n-j) {
				int lim=min((j+e)/i,n);
				rep(d,0,lim) {
					int l=max(t[i],2*d-n);
					if(i>2) chmax(l,ceil(2*(i-1)*d-j-e,i-2));
					f[j][e][d]=pls(qx(i,j,e,d,max(d+1,t[i]),min(j,n-e+d)),qy(i,j,e,d,l,min(j,d)));
				}
			}
		}
		if(!t[i+1]) {
			int m=i+1;
			rep(k,m,n) rep(p,k-m,n) {
				int q=k-m; if(p<q) continue;
				ans[k]=(ans[k]+1ll*g[m+1][p][q]*f[n-p][p-q][1])%mod;
			}
		}
		getss(i);
	}
	rep(k,rt,n) r[k]=g[0][n][k];
	rep(i,1,n) rep(j,i+1,n) ans[i]=pls(ans[i],r[j]);
	rep(k,1,n) printf("%lld ",((long long)ans[k]-ans[k+1]+mod)%mod);
	puts("");
	return 0;
}