#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int N,T;
int A[3030];
const ll mo=998244353;
ll pat[3030];
ll co[3030][3030];

ll comb(ll N_, ll C_) {
	const int NUM_=400001;
	static ll fact[NUM_+1],factr[NUM_+1],inv[NUM_+1];
	if (fact[0]==0) {
		inv[1]=fact[0]=factr[0]=1;
		for (int i=2;i<=NUM_;++i) inv[i] = inv[mo % i] * (mo - mo / i) % mo;
		for (int i=1;i<=NUM_;++i) fact[i]=fact[i-1]*i%mo, factr[i]=factr[i-1]*inv[i]%mo;
	}
	if(C_<0 || C_>N_) return 0;
	return factr[C_]*fact[N_]%mo*factr[N_-C_]%mo;
}

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N>>T;
	T=2*T-1;
	FOR(i,N) {
		cin>>A[i];
		A[i]*=2;
	}
	
	co[0][0]++; // all right
	co[0][N-1]++; // all left
	FOR(i,N-1) {
		if(T-A[i]<A[i+1]) co[0][i]++;
		else co[0][i+1]++;
	}
	for(int R=0;R<N;R++) {
		for(int L=R+1;L<N;L++) {
			int ri=N-L;
			int le=R+1;
			if(T-A[R]<A[L]) {
				pat[N-1-(ri+x)]+=comb(N-(ri+le),x);
				co[N-(ri+le)][le-1]++;
			}
			else {
				pat[le+x]+=comb(N-(ri+le),x);
				co[N-(ri+le)][le]++;
			}
		}
	}
	
	for(i=N-1;i>=0;i--) {
		FOR(j,N) {
			co[i][j]+=co[i+1][j];
			if(j) co[i][j]+=co[i+1][j-1];
			co[i][j]%=mo;
		}
	}
	
	FOR(i,N) cout<<co[0][i]<<endl;
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}