#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;
using ll = long long;

constexpr int mod = 998244353;

int main()
{
    int N,L; cin>>N>>L;
    vector<int> A(N);
    for(int i=0; i<N; i++) cin>>A[i];

    vector<vector<int>> dp(N+1, vector<int>(N+1));
    dp[1][0] = 1;
    for(int i=2; i<=N; i++){
        for(int j=0; j<=N; j++){
            if (j == 0){
                dp[i][j] = (dp[i-1][j]+1 < mod ? dp[i-1][j]+1 : 0);
            }else{
                dp[i][j] = dp[i-1][j] + dp[i-1][j-1];
                if (dp[i][j] >= mod) dp[i][j] -= mod;
            }
        }
    }

    vector<int> ans(N);
    
    ans[0]++; ans[N-1]++;
    for(int i=0; i<N-1; i++){
        if (A[i] >= L-A[i+1]) ans[i]++;
        else ans[i+1]++;
    }

    int j = N;
    for(int i=0; i<N; i++){
        while(j > 0 && A[j-1] >= L-A[i]) j--;

        for(int k=i+1, l=0; k<j; k++, l++){
            ans[k] += dp[j-i-1][l];
            if (ans[k] >= mod) ans[k] -= mod;
        }

        for(int k=i, l=0; k<N-1; k++, l++){
            ans[k] += dp[N-i-1][l];
            if (ans[k] >= mod) ans[k] -= mod;
        }
        for(int k=i, l=0; k<j-1; k++, l++){
            ans[k] -= dp[j-i-1][l];
            if (ans[k] < 0) ans[k] += mod;
        }
    }

    for(int i=0; i<N; i++){
        cout<<ans[i]<<"\n";
    }

    return 0;
}