// Nachia くんだよ

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define rep(i,n) for(int i=0; i<(n); i++)

const ull MOD = 998244353;

vector<ull> F;
vector<ull> I;
vector<ull> iF;
void initComb(int Z){
  F.assign(Z+1,1);
  for(int i=1; i<=Z; i++) F[i] = F[i-1] * i % MOD;
  I.assign(Z+1,1);
  for(int i=2; i<=Z; i++) I[i] = MOD - MOD / i * I[MOD % i] % MOD;
  iF.assign(Z+1,1);
  for(int i=1; i<=Z; i++) iF[i] = iF[i-1] * I[i] % MOD;
}
ull comb(int n,int r){ return F[n] * iF[r] % MOD * iF[n-r] % MOD; }

int N;
ll L;
vector<ll> A;
vector<ull> ans;

void solve(int i){
  int t = A[i];
  if(i != N-1) if(A[i] < L - A[i+1]) return;
  int cnt = 0;
  rep(j,i) if(L - A[j] < A[i]) cnt++;
  rep(k,cnt+1) ans[i-k] = (ans[i-k] + comb(cnt,k)) % MOD;
}

int main() {
  cin >> N >> L;
  A.resize(N);
  rep(i,N) cin >> A[i];
  rep(i,N) A[i] *= 2;
  L = L * 2 - 1;
  initComb(N);
  ans.assign(N,0);
  rep(t,2){
    rep(i,N){
      solve(i);
    }
    reverse(A.begin(),A.end());
    rep(i,N) A[i] = L - A[i];
    reverse(ans.begin(),ans.end());
  }
  rep(i,N) cout << ans[i] << "\n";
  return 0;
}


struct ios_do_not_sync{
  ios_do_not_sync(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
  }
} ios_do_not_sync_instance;