#include <bits/stdc++.h>
#define ll long long
using namespace std;

const int N = 3003;
const ll mod = 998244353LL;

int n, m;
int a[N];
ll fact[N], inv[N];
ll dp[N], ans[N];
ll c(int n, int k) {
    ll ret = fact[n];
    ret *= inv[k];
    ret %= mod;
    ret *= inv[n - k];
    ret %= mod;
    return ret;
}
ll pow(ll a, ll b = mod - 2) {
    ll ret = 1;
    while (b) {
        if (b & 1) ret *= a, ret %= mod;
        a *= a;
        a %= mod;
        b >>= 1;
    }
    return ret;
}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin >> n >> m;
    fact[0] = inv[0] = 1;
    for (int i = 1; i <= n; i++) {
        cin >> a[i - 1];
        fact[i] = fact[i - 1] * 1LL * i;
        inv[i] = pow(fact[i]);
    }
    sort(a, a + n);
    reverse(a, a + n);
    dp[0] = 1;
    for (int i = 0; i < n; i++) {
        ll sm = 0;
        for (int x = m; x >= 0; x--) {
            if (x + a[i] >= m) {
                sm += dp[x];
                dp[m] += dp[x];
                dp[m] %= mod;
            } else {
                dp[x + a[i]] += dp[x];
                dp[x + a[i]] %= mod;
            }
        }
        sm %= mod;
        for (int k = 0; k < n - i; k++) {
            ans[k] += sm * c(n - i - 1, k);
            ans[k] %= mod;
        }
    }
    for (int i = 0; i <= n; i++) {
        cout << ans[i] << "\n";
    }
    return 0;
}