#include <bits/stdc++.h>
using namespace std;
const int maxn = 3010, mod = 998244353;
int dp[maxn], cof[maxn], val[maxn][maxn], ans[maxn], pop[maxn];
int a[maxn], cnt[maxn], ttw[maxn], tw[maxn], itw[maxn];
long long smmsk[maxn];
int Pow(int a, int b) {
  int ans = 1;
  for (; b; b >>= 1, a = 1ll * a * a % mod) {
    if (b & 1) ans = 1ll * ans * a % mod;
  }
  return ans;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  ttw[0] = 1;
  for (int i = 1; i < maxn; i++) {
    ttw[i] = 2ll * ttw[i - 1] % mod;
  }
  for (int i = 0; i < maxn; i++) {
    tw[i] = ttw[i] - 1;
  }
  for (int i = 0; i < maxn; i++) {
    itw[i] = Pow(tw[i], mod - 2);
  }
  for (int i = 0; i < maxn; i++) {
    pop[i] = __builtin_popcount(i);
  }
  int n, c;
  cin >> n >> c;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    --a[i];
  }
  for (int r = 1; r <= n; r++) {
    memset(cnt, 0, sizeof cnt);
    int num = 1, zr = 1;
    for (int l = r; l >= 1; l--) {
      if (a[r] != a[l]) {
        if (cnt[a[l]] != 0)
          zr = 1ll * zr * itw[cnt[a[l]]] % mod;
        else
          num++;
        ++cnt[a[l]];
        zr = 1ll * zr * tw[cnt[a[l]]] % mod;
      }
      if (num == c) {
        val[r][l] = zr;
      }
    }
  }
  dp[0] = 1;
  for (int i = 1; i <= (n / c); i++) {
    for (int j = 1; j <= n; j++) cof[j] = dp[j - 1];
    memset(dp, 0, sizeof dp);
    memset(smmsk, 0, sizeof smmsk);
    for (int j = 1; j <= n; j++) {
      long long num = 0;
      if (c <= 20 && (1 << (c + 1)) <= n) {
        for (int msk = 0; msk < (1 << c); msk++) {
          smmsk[msk] += cof[j];
          if ((((msk) >> (a[j])) & 1))
            smmsk[msk] <<= 1;
          else
            num += (c ^ pop[msk]) & 1 ? smmsk[msk] : -smmsk[msk];
        }
        if (j % 20 == 0) {
          for (int msk = 0; msk < (1 << c); msk++) smmsk[msk] %= mod;
        }
      } else {
        for (int k = 1; k <= j; k++) {
          num += 1ll * cof[k] * val[j][k];
          if ((k & 7) == 0) num %= mod;
        }
      }
      dp[j] = num % mod;
      ans[i] = (1ll * ttw[n - j] * dp[j] + 1ll * ans[i]) % mod;
    }
  }
  ans[0] = tw[n];
  for (int i = 0; i <= n; i++) {
    ans[i] = (ans[i] - ans[i + 1]) % mod;
    if (ans[i] < 0) ans[i] += mod;
    cout << ans[i] << " ";
  }
  return cout << endl, 0;
}
