#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
#define rep(i,n)for (int i = 0; i < int(n); ++i)
#define rrep(i,n)for (int i = int(n)-1; i >= 0; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
template<class T> void chmax(T& a, const T& b) {a = max(a, b);}
template<class T> void chmin(T& a, const T& b) {a = min(a, b);}
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using mint = modint998244353;

constexpr int FACT_SIZE = 1000000;
mint Fact[FACT_SIZE + 1];
mint iFact[FACT_SIZE + 1];
const auto fact_init = [] {
    Fact[0] = mint::raw(1);
    for(int i = 1; i <= FACT_SIZE; ++i) {
        Fact[i] = Fact[i-1] * i;
    }
    iFact[FACT_SIZE] = Fact[FACT_SIZE].inv();
    for(int i = FACT_SIZE; i; --i) {
        iFact[i-1] = iFact[i] * i;
    }
    return false;
}();

mint comb(int n, int k) {
    if (k == 0) return mint::raw(1);
    assert(n >= 0 && k >= 0);
    if (k > n) return mint::raw(0);
    return Fact[n] * iFact[n - k] * iFact[k];
}

mint fact(int n) {return Fact[n];}
mint perm(int n, int k) {
    assert(0 <= n);
    return Fact[n] * iFact[n - k];
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n, l;
    cin >> n >> l;
    VI a(n);
    rep(i, n) cin >> a[i];
    vector<mint> ans(n);
    rep(i, n) {
        if (i && a[i-1] >= l - a[i]) continue;
        int cnt = 0;
        for(int j = i + 1; j < n; j++) if (a[j] < l - a[i]) cnt++;
        for(int t = 0; t <= cnt; t++) ans[i + t] += comb(cnt, t);
    }
    rep(i, n) {
        if (i + 1 < n && l - a[i + 1] > a[i]) continue;
        int cnt = 0;
        for(int j = i - 1; j >= 0; j--) if (l - a[j] <= a[i]) cnt++;
        for(int t = 0; t <= cnt; t++) ans[i - t] += comb(cnt, t);
    }
    rep(i, n) cout << ans[i].val() << '\n';
}