#include <bits/stdc++.h>

using LL = long long;

const int N = 2e5 + 7;
const int K = 200 + 7;
const int MOD = 998244353;

int n, m, k;
int f[N][K], g[N][K], a[N], ans[N];

void dp(int *f, int *g, int x) {
  for(int i = 0; i < k; ++i)
    f[i] = (g[i] + g[(i + k - x) % k]) % MOD;
}

int main() {
  
  scanf("%d%d%d", &n, &m, &k);
  for(int i = 1; i <= n; ++i)
    scanf("%d", &a[i]);

  f[0][0] = g[0][0] = 1;
  for(int i = m; i <= n; i += m) {
    for(int j = 1; j <= m; ++j)
      dp(f[j], f[j - 1], a[i - j + 1]);
    for(int j = 1; j + i < i + m && j + i <= n; ++j)
      dp(g[j], g[j - 1], a[i + j]);
    for(int j = i - m + 1; j + m - 1 <= n && j <= i; ++j) {
      ans[j] = 1LL * f[i - j + 1][0] * g[j + m - i - 1][0] % MOD;
      for(int t = 1; t < k; ++t) 
	ans[j] = (ans[j] + 1LL * f[i - j + 1][t] * g[j + m - i - 1][k - t]) % MOD;
    }
  }

  for(int i = 1; i <= n - m + 1; ++i)
    printf("%d\n", (ans[i] + MOD - 1) % MOD);
  
  return 0;
}