#include <bits/stdc++.h>
using namespace std;
const int N = 3e3 + 3, MOD = 998244353;
int a[N], cnt[N], DP[N][N], F[N][N], dp[N][1 << 11], pw[N], inv[N];
int sum(int a, int b) { return a + b - (a + b >= MOD ? MOD : 0); }
int mul(long long a, long long b) { return a * b % MOD; }
int Pow(int a, int b) {
  int res = 1;
  for (; b; b >>= 1, a = mul(a, a))
    if (b & 1) res = mul(res, a);
  return res;
}
int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  int n, c, p;
  cin >> n >> c, p = n / c;
  for (int i = 1; i <= n; i++)
    pw[i] = sum(Pow(2, i), MOD - 1), inv[i] = Pow(pw[i], MOD - 2);
  for (int i = 1; i <= n; i++) cin >> a[i], a[i]--;
  if (c <= 12) {
    dp[1][0] = 1, p++;
    if (c == 12) p = min(p, 100);
    for (int i = n; i >= 1; i--) {
      for (int j = p; j >= 1; j--) {
        for (int mask = (1 << c) - 2; mask > 0; mask--)
          if ((mask >> a[i]) & 1)
            dp[j][mask] = sum(mul(dp[j][mask], 2), dp[j][mask ^ (1 << a[i])]);
        dp[j][0] = sum(dp[j][0], dp[j - 1][(1 << c) - 1 - (1 << a[i])]);
      }
    }
    DP[1][0] = pw[n];
    for (int p = 1; p <= n; p++) {
      for (int mask = 0; mask < (1 << c) - 1; mask++)
        DP[1][p] = sum(DP[1][p], dp[p + 1][mask]);
      DP[1][0] = sum(DP[1][0], MOD - DP[1][p]);
    }
    for (int p = 0; p <= n; p++) cout << DP[1][p] << " ";
    cout << "\n";
    return 0;
  }
  for (int i = 1; i <= n; i++) {
    memset(cnt, 0, sizeof cnt);
    int res = 1, t = 1, j = i;
    cnt[a[j]]++;
    while (j < n && t < c) {
      cnt[a[++j]]++;
      if (cnt[a[j]] == 1) t++;
    }
    if (t < c) break;
    for (int x = 0; x < c; x++) res = mul(res, pw[cnt[x]]);
    F[i][j] = mul(res, inv[cnt[a[j]]]);
    for (j++; j <= n; j++) {
      res = mul(res, inv[cnt[a[j]]]);
      F[i][j] = res;
      res = mul(res, pw[++cnt[a[j]]]);
    }
  }
  DP[n + 1][0] = 1;
  for (int i = n; i >= 1; i--) {
    for (int j = i; j <= n; j++)
      for (int k = 1; k <= p; k++)
        DP[i][k] = sum(DP[i][k], mul(F[i][j], DP[j + 1][k - 1]));
    DP[i][0] = sum(pw[n - i + 1], 1);
    for (int k = 1; k <= p; k++) DP[i][0] = sum(DP[i][0], MOD - DP[i][k]);
  }
  DP[1][0] = sum(DP[1][0], MOD - 1);
  for (int p = 0; p <= n; p++) cout << DP[1][p] << " ";
  cout << "\n";
  return 0;
}
