#include <bits/stdc++.h>
using namespace std;
const int N = 3010;
const int mod = 998244353;
int gi() {
  int x = 0, o = 1;
  char ch = getchar();
  while ((ch < '0' || ch > '9') && ch != '-') ch = getchar();
  if (ch == '-') o = -1, ch = getchar();
  while (ch >= '0' && ch <= '9') x = x * 10 + ch - '0', ch = getchar();
  return x * o;
}
int n, c, a[N];
int qpow(int a, int b) {
  int ret = 1;
  while (b) {
    if (b & 1) ret = 1ll * ret * a % mod;
    a = 1ll * a * a % mod, b >>= 1;
  }
  return ret;
}
void inc(int &a, int b) {
  a += b;
  if (a >= mod) a -= mod;
}
namespace T1 {
int f[N][N], s[N], cnt[N], g[2][N][N], b[N], ib[N], h[N][N], ans[N], iv[N];
void solve() {
  f[0][0] = b[0] = ib[0] = 1;
  for (int i = 1; i <= n; i++)
    b[i] = (b[i - 1] << 1) % mod,
    ib[i] = 1ll * ib[i - 1] * ((mod + 1) >> 1) % mod,
    iv[i] = qpow(b[i] - 1, mod - 2);
  for (int l = 1; l <= n; l++) {
    memset(s, 0, sizeof(s));
    int x = 1, y = c;
    for (int r = l; r <= n; r++) {
      if (!s[a[r]])
        --y;
      else
        x = 1ll * x * iv[b[s[a[r]]]] % mod;
      ++s[a[r]];
      x = 1ll * x * (b[s[a[r]]] - 1) % mod;
      h[l][r] = y ? 0 : x;
    }
  }
  for (int i = 1; i <= n; i++) {
    for (int j = 0; j < i; j++)
      for (int k = 1; k <= i / c; k++) g[i & 1][j][k] = 0;
    for (int j = 0; j < i; j++)
      for (int k = 1; k <= i / c; k++) {
        if (!f[j][k - 1]) continue;
        int v = (1ll * f[j][k - 1] * h[j + 1][i] -
                 1ll * g[i & 1 ^ 1][j][k] * b[i]) %
                mod;
        f[i][k] = (f[i][k] + v) % mod;
        g[i & 1][j][k] = (g[i & 1 ^ 1][j][k] + 1ll * v * ib[i]) % mod;
      }
  }
  for (int j = 0; j <= n; j++) {
    int ans = 0;
    for (int i = 0; i <= n; i++)
      ans = (ans +
             1ll * f[i][j] * (b[n - i] - h[i + 1][n] - (i == 0 && j == 0))) %
            mod;
    cout << (ans + mod) % mod << ' ';
  }
}
}  // namespace T1
namespace T2 {
int f[2][N][1 << 12], m;
void solve() {
  f[0][0][0] = 1;
  m = (1 << c) - 1;
  for (int i = 1; i <= n; i++) {
    for (int j = 0; j <= i / c; j++)
      for (int k = 0; k < m; k++) f[i & 1][j][k] = 0;
    for (int j = 0; j <= i / c; j++)
      for (int k = 0; k < m; k++) {
        if (!f[i & 1 ^ 1][j][k]) continue;
        inc(f[i & 1][j][k], f[i & 1 ^ 1][j][k]);
        int t = k | (1 << (a[i] - 1));
        inc(f[i & 1][j + (t == m)][t == m ? 0 : t], f[i & 1 ^ 1][j][k]);
      }
  }
  for (int j = 0; j <= n; j++) {
    int ans = 0;
    for (int k = 0; k < m; k++) ans = (ans + f[n & 1][j][k]) % mod;
    if (!j) ans = (ans - 1 + mod) % mod;
    cout << ans << ' ';
  }
}
}  // namespace T2
int main() {
  cin >> n >> c;
  for (int i = 1; i <= n; i++) a[i] = gi();
  if (c <= 12)
    T2::solve();
  else
    T1::solve();
  return 0;
}
