#include<algorithm>
#include<iostream>
#include<vector>
#include<map>
#include<cassert>
using namespace std;
using ll = long long;

#include<atcoder/modint>
using mint = atcoder::modint998244353;
mint comb[3010][3010];
int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    comb[0][0] = 1;
    for(int i = 1;i<3010;i++){
        comb[i][i] = comb[i][0] = 1;
        for(int j = 1;j<i;j++) comb[i][j] = comb[i-1][j-1] + comb[i-1][j];
    }
    
    ll n,l;
    cin>>n>>l;
    vector<mint> ans(n+1,0);
    vector<ll> a(n);
    for(int i = 0;i<n;i++) cin>>a[i];

    for(int i = 0;i<n;i++){
        {
            ll t = a[i];
            int cnt = 0;
            mint tmp = 1;
            for(int j = 0;j<i;j++){
                ll nt = l - a[j];
                if(nt<=t) cnt++;
            }
            for(int j = i + 1;j<n;j++){
                int can = 0;
                ll nt = a[j];
                if(nt<t) can++;
                nt = l -a[j];
                if(nt<=t) can++;
                tmp *= can;
            }
            cout<<i<<" "<<cnt<<endl;
            for(int j = 0;j<=cnt;j++){
                if(i-j<0) break;
                ans[i-j] += tmp * comb[cnt][j];
            }
        }
        {
            ll t = l - a[i];
            int cnt = 0;
            mint tmp = 1;
            for(int j = 0;j<i;j++){
                int can = 0;
                ll nt = a[j];
                if(nt<t) can++;
                nt = l - a[j];
                if(nt<t) can++;
                tmp *= can;
            }
            for(int j = i + 1;j<n;j++){
                ll nt = a[j];
                if(nt<t) cnt++;
            }
            for(int j = 0;j<=cnt;j++){
                if(i+j>=n) break;
                ans[i+j] += tmp * comb[cnt][j];
            }
        }
    }
    for(int i = 0;i<n;i++) cout<<ans[i].val()<<endl;



}