#include<bits/stdc++.h>

using namespace std;


typedef long long ll;
typedef long double ld;

#define endl "\n"
#define all(a) a.begin(), a.end()
#define pb push_back
#define eb emplace_back
//#define int long long



// Don't Start typing till you complete the idea.


// Check these things for WA and before submitting
// 1. Did you clear all the global arrays
// 2. Did you checked your <= >= < > 
// 3. Did you take the input properly. Did you use break or return while taking input?
// 4. Did you divide by 0.
// 5. Check array , vector , etc size
// 6. in the while loop did you miss something that would cause infinite loop?
// 7. Did you save your dp?
// 8. Are you trying to use something after deleting it?
// 9. Did you read the problem statement wrong?
// 10. Did you check the constrains of the problem properly
// 11. Did you checked for smaller cases like 1 , 0 , etc
// 12. Is it something to with overflow?
// 13. Did you initialized all the variables properly?
// 14. Did you use the formulas correctly?

// STRESS TESTING !!!!!! STRESS TESTING !!!!!
// STRESS Testing Not working?
// Stress test for multiple cases? 
// Stress test for big inputs?
// Stress test for really small inputs?
// Even then if it doesn't work -> Did you wrote the wrong Brute force code


// Check these things if you are not generating ideas
// 1. Did you try thinking it in reverse?
// 2. Read the problem statement again
// 3. Check the constraints again
// 4. Try smaller cases in notebook and try to expand
// 5. Think about invariants
// 6. Think simpler ideas maybe?
// 7. Think brute force and try to get something out of it.
// 8. Maybe take a deep breath and take a break for few minutes and drink some water? :3 
const int M = 3009;
const int N = 3009;
const int MOD = 998244353;
int dp[M];
int dp2[M];
int val[N];
int ans[N];
int fact[N];
int inv[N];
long long binpow(long long a, long long b) {
    long long res = 1;
    a %= MOD;
    while (b > 0) {
        if (b & 1)
            res = res * a % MOD;
        a = a * a % MOD;
        b >>= 1;
    }
    return res;
}
void prec(){
  fact[0] = fact[1] = inv[0] = 1;
  for(int i = 2; i <= 3000; i++){
    fact[i] = 1LL * fact[i - 1] * i % MOD;
  }
  inv[3000] = binpow(fact[3000] , MOD - 2);
  for(int i = 3000 - 1; i >= 1; i--){
    inv[i] = 1LL * inv[i + 1] * (i + 1) % MOD;
  }
}
int ncr(int n , int r){
  int num = 1LL * fact[n] * inv[r] % MOD;
  num = 1LL * num * inv[n - r] % MOD;
  return num;
}
void GG()
{
	int n , k;
  cin >> n >> k;
  vector<int> v(n + 1);
  for(int i = 1; i <= n; i++) cin >> v[i];
  sort(v.begin() + 1 , v.end() , greater<int>());
  dp[0] = 1;
  for(int i = 1; i <= n; i++){
    for(int j = 0; j < k; j++){
      dp2[min(k , j + v[i])] = (dp2[min(k , j + v[i])] + dp[j]) % MOD;
    }
    val[i] = dp2[k];
    for(int j = 0; j <= k; j++){
      dp2[j] = (dp2[j] + dp[j]) % MOD;
    }
    for(int j = 0; j <= k; j++){
      dp[j] = dp2[j];
      dp2[j] = 0;
    }
  }
  for(int i = 1; i <= n; i++){
    if(val[i] == 0) continue;
    for(int xtr = 0; xtr <= n - i; xtr++){
      int ad = 1LL * val[i] * ncr(n - i , xtr);
      ans[xtr] = (ans[xtr] + ad) % MOD;
    }
  }
  for(int i = n - 1; i >= 0; i--) ans[i] = (ans[i + 1] + ans[i]) % MOD;
  for(int i = 0; i <= n; i++) cout << ans[i] << endl;
}

int32_t main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
  prec();
	int ttc=1;
	// cin>>ttc;
	//int cnt=0;
	while(ttc--)
	{
		//cout<<"Case "<<++cnt<<": ";
		GG();
	}
}