#include <stdio.h>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf 1000000001
struct combi{
	deque<mint> kaijou;
	deque<mint> kaijou_;
	
	combi(int n){
		kaijou.push_back(1);
		for(int i=1;i<=n;i++){
			kaijou.push_back(kaijou[i-1]*i);
		}
		
		mint b=kaijou[n].inv();
		
		kaijou_.push_front(b);
		for(int i=1;i<=n;i++){
			int k=n+1-i;
			kaijou_.push_front(kaijou_[0]*k);
		}
	}
	
	mint combination(int n,int r){
		if(r>n)return 0;
		mint a = kaijou[n]*kaijou_[r];
		a *= kaijou_[n-r];
		return a;
	}
	
	mint junretsu(int a,int b){
		mint x = kaijou_[a]*kaijou_[b];
		x *= kaijou[a+b];
		return x;
	}
	
	mint catalan(int n){
		return combination(2*n,n)/(n+1);
	}
	
};


int main(){
	
	int N,L;
	cin>>N>>L;
	
	vector<int> A(N);
	rep(i,N){
		cin>>A[i];
	}
	
	vector<mint> ans(N,0);
	combi C(100000);
	rep(i,N){
		mint cur = 1;
		for(int j=i+1;j<N;j++){
			if(L - A[j]>A[i]){
				cur = 0;
			}
			else{
			}
		}
		if(cur==0)continue;
		int cnt = 0;
		rep(j,i){
			if(L-A[j]<=A[i])cnt++;
		}
		for(int j=i;j>=0;j--){
			if(cnt>=i-j)ans[j] += C.combination(cnt,i-j);
		}
		
	}
	
	rep(i,N){
		mint cur = 1;
		rep(j,i){
			if(A[j] >= L-A[i]){
				cur = 0;
			}
		}
		if(cur==0)continue;
		int cnt =0;
		for(int j=i+1;j<N;j++){
			if(A[j]<L-A[i])cnt++;
		}
		for(int j=i;j<N;j++){
			if(cnt>=j-i)ans[j] += C.combination(cnt,j-i);
		}
	}
	
	rep(i,N){
		cout<<ans[i].val()<<endl;
	}
	
	return 0;
}