#include <cstdio>
typedef long long ll;

const int MAXN = 2e5 + 10;
const int MAXK = 310;
const ll MOD = 998244353;

int n, k;
ll a[MAXN], pow[MAXN][MAXK];
ll C[MAXK][MAXK];

int main() {
  freopen("MyGo.in", "r", stdin);
  freopen("MyGo.out", "w", stdout);
  scanf("%d %d", &n, &k);
  for (int i = 1; i <= n; ++i) scanf("%lld", &a[i]);
  
  for (int i = 1; i <= n; ++i) {
    pow[i][0] = 1;
    for (int j = 1; j <= k; ++j) pow[i][j] = pow[i][j - 1] * a[i] % MOD;
  }
  
  C[0][0] = 1;
  for (int i = 1; i <= k; ++i) {
    for (int j = 0; j <= i; ++j) {
      C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % MOD;
    }
  }
  
  for (int X = 1; X <= k; ++X) {
    ll sum = 0;
    for (int L = 1; L <= n; ++L) {
      for (int R = L + 1; R <= n; ++R) {
        for (int i = 0; i <= X; ++i) {
          sum = (sum + C[X][i] * pow[L][i] * pow[R][X - i]) % MOD; 
        }
      }
    }
    printf("%lld\n", sum);
  }
  return 0;
}