#include<iostream>
#include<atcoder/modint>
#include<vector>
#include<algorithm>
using namespace std;
using mint=atcoder::modint998244353;
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;
		mint C=1;
		for(int k=0;k<=nc;k++)
		{
			if(B[i].first.second==0)
			{
				ans[N-(r+nc-k)-1]+=C;
			}
			else
			{
				ans[l+k]+=C;
			}
			C=C*(nc-k)/(k+1);
		}
	}
	for(int i=0;i<N;i++)cout<<ans[i].val()<<endl;
}