func_code_string: #include <bits/stdc++.h>   const int MOD = 998244353;   int n, c, a[3005], cnt[3005], pw[3005], ipw1[3005], ans[3005];   inline int mval(int x) { return x >= MOD ? x - MOD : x; }   inline void inc(int &x, int a) { (x += a) >= MOD && (x -= MOD); }   inline void dec(int &x, int a) { x = mval(MOD + x - a); }   inline int qpow(int x, int p) {     int ret = 1;     while (p) {       if (p & 1) ret = 1ll * ret * x % MOD;       p >>= 1, x = 1ll * x * x % MOD;     }     return ret;   }   namespace sub1 {   int f[3005][1 << 10], g[3005];   inline void solve(void) {     int u = (1 << c) - 1;     g[0] = 1;     ans[0] = pw[n] - 1;     for (int t = 1; t * c <= n + 1; ++t) {       for (int i = 1; i <= n; ++i) std::fill(f[i], f[i] + (1 << c), 0);       for (int i = 1; i <= n; ++i) {         inc(f[i][0], g[i - 1]);         inc(f[i][1 << a[i]], g[i - 1]);         for (int s = 0; s < u; ++s)           inc(f[i][s], f[i - 1][s]), inc(f[i][s | (1 << a[i])], f[i - 1][s]);       }       for (int i = 0; i <= n; ++i) g[i] = f[i][u ^ (1 << a[i])];       for (int i = 0; i <= n; ++i) inc(ans[t], 1ll * g[i] * pw[n - i] % MOD);     }     for (int i = 0; i <= n; ++i) dec(ans[i], ans[i + 1]);   }   }  // namespace sub1   namespace sub2 {   long long *f, *g, dp[2][3005], tr[3005][3005];   inline void solve(void) {     for (int i = 1; i <= n; ++i) {       std::fill(cnt, cnt + c + 1, 0);       int cur = 1, cc = 0;       tr[i][i] = (c == 1);       for (int j = i - 1; j; --j) {         if (a[j] != a[i]) {           cur = 1ll * ipw1[cnt[a[j]]] * cur % MOD;           if (!cnt[a[j]]) ++cc;           ++cnt[a[j]];           cur = 1ll * (pw[cnt[a[j]]] - 1) * cur % MOD;         }         tr[j][i] = (cc == c - 1 ? cur : 0);       }     }     f = dp[0], g = dp[1];     f[0] = 1;     ans[0] = pw[n] - 1;     for (int t = 1; t * c <= n; ++t) {       std::swap(f, g);       std::fill(f, f + n + 1, 0);       for (int j = 1; j <= n; ++j)         if (g[j - 1])           for (int i = j; i <= n; ++i) f[i] += g[j - 1] * tr[j][i] % MOD;       for (int i = 1; i <= n; ++i) f[i] %= MOD;       for (int i = 0; i <= n; ++i) inc(ans[t], f[i] * pw[n - i] % MOD);     }     for (int i = 0; i <= n; ++i) dec(ans[i], ans[i + 1]);   }   }  // namespace sub2   int main() {     scanf( %d%d , &n, &c);     pw[0] = 1;     ipw1[0] = 1;     for (int i = 1; i <= n; ++i)       pw[i] = 2ll * pw[i - 1] % MOD, ipw1[i] = qpow(pw[i] - 1, MOD - 2);     for (int i = 1; i <= n; ++i) scanf( %d , a + i), --a[i];     if (c <= 10)       sub1::solve();     else       sub2::solve();     for (int i = 0; i <= n; ++i) printf( %d  , ans[i]);     return 0;   }   