#line 1 "a.cpp"
#include<iostream>
#include<atcoder/modint>
#include<vector>
#include<algorithm>
using namespace std;
using mint=atcoder::modint998244353;
#line 2 "/home/kotatsugame/library/math/combination.cpp"
template<typename T>
struct combination{
	vector<T>fac,invfac;
	combination(size_t N=0):fac(1,1),invfac(1,1)
	{
		make_table(N);
	}
	void make_table(size_t N)
	{
		if(fac.size()>N)return;
		size_t now=fac.size();
		N=max(N,now*2);
		fac.resize(N+1);
		invfac.resize(N+1);
		for(size_t i=now;i<=N;i++)fac[i]=fac[i-1]*i;
		invfac[N]=1/fac[N];
		for(size_t i=N;i-->now;)invfac[i]=invfac[i+1]*(i+1);
	}
	T factorial(size_t n)
	{
		make_table(n);
		return fac[n];
	}
	T P(size_t n,size_t k)
	{
		if(n<k)return 0;
		make_table(n);
		return fac[n]*invfac[n-k];
	}
	T C(size_t n,size_t k)
	{
		if(n<k)return 0;
		make_table(n);
		return fac[n]*invfac[n-k]*invfac[k];
	}
	T H(size_t n,size_t k)
	{
		if(n==0)return k==0?1:0;
		return C(n-1+k,k);
	}
};
#line 8 "a.cpp"
combination<mint>C;
int N,L;
int A[3030];
mint ans[3030];
main()
{
	cin>>N>>L;
	vector<pair<pair<int,int>,int> >B;
	for(int i=0;i<N;i++)
	{
		cin>>A[i];
		B.push_back(make_pair(make_pair(A[i],1),i));
		B.push_back(make_pair(make_pair(L-A[i],0),i));
	}
	sort(B.begin(),B.end());
	int l=0,r=0;
	for(int i=0;i<N;i++)
	{
		if(B[i].first.second==0)r++;
		else l++;
	}
	if(B[N-1].first.second==0)
	{
		ans[N-r]=1;
	}
	else
	{
		ans[l-1]=1;
	}
	for(int i=N;i<2*N;i++)
	{
		if(B[i].first.second==0)l--;
		else r--;
		int nc=i-N;
		for(int k=0;k<=nc;k++)
		{
			if(B[i].first.second==0)
			{
				ans[N-(r+nc-k)-1]+=C.C(nc,k);
			}
			else
			{
				ans[l+k]+=C.C(nc,k);
			}
		}
	}
	for(int i=0;i<N;i++)cout<<ans[i].val()<<endl;
}