#include <bits/stdc++.h>
#define int long long
#define fir first
#define sec second
#define el '\n'
#define FINISH cerr << "FINISH" << endl;
#define debug(x) cerr << #x << " == " << x << endl
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
const int mod = 998244353;
const int inf = 0x3f3f3f3f;
const int N = 3030;
int C[N][N];
void solve()
{
	int n, m;
	cin >> n >> m;
	vector<int> a(n + 1, 0), ans(n + 1, 0);
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
	}
	sort(next(a.begin()), a.end(), [&](int x, int y) { return x > y; });
	vector dp(n + 1, vector<int>(m + 1, 0));
	dp[0][0] = 1;
	for (int i = 0; i < n; i++) {
		vector<int> now(m + 1, 0);
		for (int j = 0; j <= m; j++) {
			dp[i + 1][j] += dp[i][j] %= mod;
			dp[i + 1][min(j + a[i + 1], m)] += dp[i][j] %= mod;
			now[min(j + a[i + 1], m)] += dp[i][j] %= mod;
		}
		for (int k = 0; k <= n - i - 1; k++) {
			int r = (1ll * C[n - i - 1][k] * now[m]) % mod;
			ans[k] += r %= mod;
		}
	}
	for (int i = 0; i <= n; i++) {
		cout << ans[i] << " ";
	}
	cout << el;
}
signed main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	C[0][0] = 1;
	for (int i = 1; i <= 3000; i++) {
		C[i][0] = 1;
		for (int j = 1; j <= i; j++) {
			C[i][j] = (C[i - 1][j - 1] + C[i - 1][j]) % mod;
		}
	}
	int T = 1;
	// cin >> T;
	while (T--) {
		solve();
	}
	return 0;
}