#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")

////////////////////////////////////////////////////////////////////////////////
template <unsigned M_> struct ModInt {
  static constexpr unsigned M = M_;
  unsigned x;
  constexpr ModInt() : x(0U) {}
  constexpr ModInt(unsigned x_) : x(x_ % M) {}
  constexpr ModInt(unsigned long long x_) : x(x_ % M) {}
  constexpr ModInt(int x_) : x(((x_ %= static_cast<int>(M)) < 0) ? (x_ + static_cast<int>(M)) : x_) {}
  constexpr ModInt(long long x_) : x(((x_ %= static_cast<long long>(M)) < 0) ? (x_ + static_cast<long long>(M)) : x_) {}
  ModInt &operator+=(const ModInt &a) { x = ((x += a.x) >= M) ? (x - M) : x; return *this; }
  ModInt &operator-=(const ModInt &a) { x = ((x -= a.x) >= M) ? (x + M) : x; return *this; }
  ModInt &operator*=(const ModInt &a) { x = (static_cast<unsigned long long>(x) * a.x) % M; return *this; }
  ModInt &operator/=(const ModInt &a) { return (*this *= a.inv()); }
  ModInt pow(long long e) const {
    if (e < 0) return inv().pow(-e);
    ModInt a = *this, b = 1U; for (; e; e >>= 1) { if (e & 1) b *= a; a *= a; } return b;
  }
  ModInt inv() const {
    unsigned a = M, b = x; int y = 0, z = 1;
    for (; b; ) { const unsigned q = a / b; const unsigned c = a - q * b; a = b; b = c; const int w = y - static_cast<int>(q) * z; y = z; z = w; }
    assert(a == 1U); return ModInt(y);
  }
  ModInt operator+() const { return *this; }
  ModInt operator-() const { ModInt a; a.x = x ? (M - x) : 0U; return a; }
  ModInt operator+(const ModInt &a) const { return (ModInt(*this) += a); }
  ModInt operator-(const ModInt &a) const { return (ModInt(*this) -= a); }
  ModInt operator*(const ModInt &a) const { return (ModInt(*this) *= a); }
  ModInt operator/(const ModInt &a) const { return (ModInt(*this) /= a); }
  template <class T> friend ModInt operator+(T a, const ModInt &b) { return (ModInt(a) += b); }
  template <class T> friend ModInt operator-(T a, const ModInt &b) { return (ModInt(a) -= b); }
  template <class T> friend ModInt operator*(T a, const ModInt &b) { return (ModInt(a) *= b); }
  template <class T> friend ModInt operator/(T a, const ModInt &b) { return (ModInt(a) /= b); }
  explicit operator bool() const { return x; }
  bool operator==(const ModInt &a) const { return (x == a.x); }
  bool operator!=(const ModInt &a) const { return (x != a.x); }
  friend std::ostream &operator<<(std::ostream &os, const ModInt &a) { return os << a.x; }
};
////////////////////////////////////////////////////////////////////////////////

constexpr unsigned MO = 998244353;
using Mint = ModInt<MO>;

constexpr int LIM_INV = 9010;
Mint inv[LIM_INV], fac[LIM_INV], invFac[LIM_INV];

void prepare() {
  inv[1] = 1;
  for (int i = 2; i < LIM_INV; ++i) {
    inv[i] = -((Mint::M / i) * inv[Mint::M % i]);
  }
  fac[0] = invFac[0] = 1;
  for (int i = 1; i < LIM_INV; ++i) {
    fac[i] = fac[i - 1] * i;
    invFac[i] = invFac[i - 1] * inv[i];
  }
}


int N, C;
vector<int> A;

/*
  [i & 1][s][k][r][l]
    s: has last attack
    k: # real attack
    exp(rx) x^l
*/
Mint dp[2][2][310][40][310];

int main() {
  prepare();
  
  for (; ~scanf("%d%d", &N, &C); ) {
    A.resize(N);
    for (int i = 0; i < N; ++i) {
      scanf("%d", &A[i]);
    }
    
    vector<int> ASum(N + 1, 0);
    for (int i = 0; i < N; ++i) ASum[i + 1] = ASum[i] + A[i];
    
    memset(dp, 0, sizeof(dp));
    dp[0][0][0][0][0] = 1;
    for (int i = 0; i < N; ++i) {
      auto crt = dp[i & 1], nxt = dp[(i + 1) & 1];
      for (int s = 0; s < 2; ++s) for (int k = 0; k <= ASum[i + 1]; ++k) for (int r = 0; r <= i + 1; ++r) for (int l = 0; l <= ASum[i + 1]; ++l) nxt[s][k][r][l] = 0;
      for (int s = 0; s < 2; ++s) for (int k = 0; k <= ASum[i]; ++k) for (int r = 0; r <= i; ++r) for (int l = 0; l <= ASum[i]; ++l) {
        const Mint f = crt[s][k][r][l];
        if (f) {
          if (i >= C) {
            // x^b/b!
            for (int b = 0; b < A[i]; ++b) nxt[s][k + b][r][l + b] += f * invFac[b];
            // x^(b-1)/(b-1)!
            if (!s) for (int b = 1; b < A[i]; ++b) nxt[1][k + b][r][l + (b - 1)] += f * invFac[b - 1];
          }
          // exp(x) - \sum[0<=b<a] x^b/b!
          nxt[s][k + A[i]][r + 1][l] += f;
          for (int b = 0; b < A[i]; ++b) nxt[s][k + A[i]][r][l + b] -= f * invFac[b];
          // x^(a-1)!/(a-1)!
          if (!s) nxt[1][k + A[i]][r][l + (A[i] - 1)] += f * invFac[A[i] - 1];
        }
      }
    }
    
    vector<Mint> ans(ASum[N] + 1, 0);
    for (int r = 0; r < N; ++r) for (int l = 0; l <= ASum[N]; ++l) {
      /*
        \sum[j>=0] (1/N)^(j+1) [x^j/j!] e^(rx) x^l  (j selections before last)
        = \sum[j>=l] (1/N)^(j+1) j^(fall l) r^(j-l)
        = N^-(l+1) \sum[j>=0] (r/N)^j (j+l)^(fall l)
        = N^-(l+1) l!/(1-r/N)^(l+1)
      */
      const Mint val = Mint(N).pow(-(l+1)) * fac[l] * Mint(1 - r * inv[N]).pow(-(l+1));
      for (int k = 1; k <= ASum[N]; ++k) {
// if(N<=5&&dp[N & 1][1][k][r][l])cerr<<k<<" "<<r<<" "<<l<<": "<<dp[N & 1][1][k][r][l]<<" "<<val<<endl;
        ans[k] += dp[N & 1][1][k][r][l] * val;
      }
    }
    
    for (int k = 1; k <= ASum[N]; ++k) {
      if (k > 1) printf(" ");
      printf("%u", ans[k].x);
    }
    puts("");
  }
  return 0;
}