#include <bits/stdc++.h>
using namespace std;
const int mod = 998244353;
inline int add(int a, int b) {
  if ((a += b) >= mod) a -= mod;
  return a;
}
inline int dec(int a, int b) {
  if ((a -= b) < 0) a += mod;
  return a;
}
inline int mult(int a, int b) {
  long long t = 1ll * a * b;
  if (t >= mod) t %= mod;
  return t;
}
inline int power(int a, int b) {
  int out = 1;
  while (b) {
    if (b & 1) out = mult(out, a);
    a = mult(a, a);
    b >>= 1;
  }
  return out;
}
int n, c, a[3010];
namespace S1 {
int dp[2][3010][1 << 10];
void solve() {
  int cur = 0;
  dp[cur][0][0] = 1;
  for (int i = 1; i <= n; i++) {
    cur ^= 1;
    a[i]--;
    memset(dp[cur], 0, sizeof(dp[cur]));
    for (int j = 0; j <= n / c; j++) {
      for (int k = 0; k < (1 << c); k++)
        if (dp[cur ^ 1][j][k]) {
          dp[cur][j][k] = add(dp[cur][j][k], dp[cur ^ 1][j][k]);
          if ((k | (1 << a[i])) == ((1 << c) - 1))
            dp[cur][j + 1][0] = add(dp[cur][j + 1][0], dp[cur ^ 1][j][k]);
          else
            dp[cur][j][k | (1 << a[i])] =
                add(dp[cur][j][k | (1 << a[i])], dp[cur ^ 1][j][k]);
        }
    }
  }
  for (int i = 0; i <= n; i++) {
    if (i > n / c) {
      printf("0 ");
      continue;
    }
    int tc = 0;
    for (int j = 0; j < (1 << c); j++) tc = add(tc, dp[cur][i][j]);
    if (i == 0) tc = dec(tc, 1);
    printf("%d ", tc);
  }
}
}  // namespace S1
namespace S2 {
int f[3010][310], g[3010][3010], cnt[3010], sum[3010][310], pw[3010], inv[3010];
inline void solve() {
  pw[0] = 1;
  for (int i = 1; i <= n; i++) pw[i] = add(pw[i - 1], pw[i - 1]);
  for (int i = 1; i <= n; i++) inv[i] = power(pw[i] - 1, mod - 2);
  for (int i = 1; i <= n; i++) {
    memset(cnt, 0, sizeof(cnt));
    int cur = 1, tot = 0;
    for (int j = i; j <= n; j++) {
      if (a[i] == a[j]) {
        cnt[a[i]]++;
        if (cnt[a[i]] == 1)
          tot++;
        else
          cur = add(cur, cur);
      } else {
        if (!cnt[a[j]])
          ++tot, ++cnt[a[j]];
        else {
          cur = mult(cur, inv[cnt[a[j]]]);
          ++cnt[a[j]];
          cur = mult(cur, pw[cnt[a[j]]] - 1);
        }
      }
      if (tot == c && a[i] != a[j]) g[i][j] = mult(cur, inv[cnt[a[j]]]);
    }
  }
  f[n + 1][0] = 1;
  sum[n + 1][0] = 1;
  for (int i = n; i >= 1; i--) {
    int ts = 0;
    for (int j = 1; j <= n / c; j++) {
      for (int k = i + c - 1; k <= n && sum[k + 1][j - 1]; k++)
        f[i][j] = add(f[i][j], mult(g[i][k], sum[k + 1][j - 1]));
      sum[i][j] = add(sum[i + 1][j], f[i][j]);
      ts = add(ts, f[i][j]);
    }
    f[i][0] = dec(pw[n - i], ts);
    sum[i][0] = add(sum[i + 1][0], f[i][0]);
  }
  sum[1][0] = dec(sum[1][0], 1);
  for (int i = 0; i <= n / c; i++) printf("%d ", sum[1][i]);
  for (int i = n / c + 1; i <= n; i++) printf("0 ");
}
}  // namespace S2
int main() {
  scanf("%d%d", &n, &c);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  if (c <= 10)
    S1::solve();
  else
    S2::solve();
  return 0;
}
