#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
long long dp[3005][3005], f[3005][3005], mod = 998244353, ans[3005], a[3005],
                                         c[3005], p2[3005], p[3005], inv[3005];
long long __pow(long long x, long long y) {
  if (!y) return 1;
  long long t = __pow(x, y / 2);
  if (y & 1) return t * t % mod * x % mod;
  return t * t % mod;
}
signed main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  long long n, m;
  cin >> n >> m;
  if (m <= 11) {
    for (long long i = 1; i <= n; i++) cin >> a[i];
    dp[0][0] = 1;
    long long to;
    for (long long i = 1; i <= n; i++)
      for (long long j = i / m; j >= 0; j--)
        for (long long mask = (1 << m) - 1; mask >= 0; mask--) {
          long long &t = dp[j][mask];
          while (t >= mod) t -= mod;
          to = mask | (1 << (a[i] - 1));
          if (to == (1 << m) - 1) {
            dp[j + 1][0] += t;
          } else
            dp[j][to] += t;
        }
    for (long long j = n / m; j >= 0; j--)
      for (long long mask = (1 << m) - 1; mask >= 0; mask--)
        ans[j] += dp[j][mask];
    ans[0]--;
    for (long long i = 0; i <= n; i++) cout << ans[i] % mod << ' ';
    return 0;
  }
  p2[0] = 1;
  for (long long i = 1; i <= n; i++) cin >> a[i], p2[i] = p2[i - 1] * 2 % mod;
  p[n] = 1;
  for (long long i = 0; i <= n; i++) inv[i] = __pow(p2[i] - 1, mod - 2);
  for (long long i = 1; i <= n; i++) {
    long long cnt = 0;
    for (long long j = 1; j <= m; j++) c[j] = 0;
    long long num = 1;
    for (long long j = i; j <= n; j++) {
      if (!c[a[j]]) cnt++;
      c[a[j]]++;
      if (c[a[j]] != 1)
        num = num * inv[c[a[j]] - 1] % mod * (p2[c[a[j]]] - 1) % mod;
      if (cnt == m) f[i][j] = num * inv[c[a[j]]] % mod;
    }
    if (cnt == m)
      p[i - 1] = (p2[n - i + 1] - num + mod) % mod;
    else
      p[i - 1] = p2[n - i + 1];
  }
  dp[0][0] = 1;
  for (long long i = m; i <= n; i++)
    for (long long j = 1; j <= i / m; j++) {
      __int128 t = 0;
      for (long long k = (j - 1) * m; k <= i - m; k++)
        t = t + dp[k][j - 1] * f[k + 1][i];
      dp[i][j] = t % mod;
      ans[j] = (ans[j] + dp[i][j] * p[i]) % mod;
    }
  long long sum = 1;
  for (long long i = 1; i <= n; i++) sum = sum * 2 % mod;
  sum--;
  for (long long i = 1; i <= n / m; i++) sum = (sum - ans[i] + mod) % mod;
  cout << sum << ' ';
  for (long long i = 1; i <= n; i++) cout << ans[i] << ' ';
  return 0;
}
