#include <bits/stdc++.h>
#include <atcoder/all>

using namespace std;
using namespace atcoder;
using mint = modint998244353;

// モノイド
using poly = vector<mint>;
poly unit = {};

poly op(poly f, poly g) {
  // unit
  if (f.empty()) return g;
  if (g.empty()) return f;
  int K = f.size();
  // より sparse な方を f にする
  int nf = 0, ng = 0;
  for (auto x: f)
    if (x.val() != 0) ++nf;
  for (auto x: g)
    if (x.val() != 0) ++ng;
  if (nf > ng) swap(f, g);
  // f[i] == 0 の場合を枝狩り。f が疎だと高速になる。
  poly h(K);
  for (int i = 0; i < K; ++i) {
    if (f[i].val() == 0) continue;
    for (int j = 0; j < K; ++j) {
      int k = (i + j < K ? i + j : i + j - K);
      h[k] += f[i] * g[j];
    }
  }
  return h;
}

void solve() {
  int N, M, K;
  cin >> N >> M >> K;
  vector<poly> A(N);
  for (int n = 0; n < N; ++n) {
    int a;
    cin >> a;
    A[n].resize(K);
    A[n][0] += 1, A[n][a] += 1;
  }

  using T = tuple<int, int, int>; // (index, left, right)
  int Q = N - M + 1;
  vector<T> query(Q);
  for (int q = 0; q < Q; ++q) { query[q] = {q, q, q + M}; }

  vector<int> ANS(Q);

  auto calc = [&](int L, int M, int R, vector<T>& query) -> void {
    static vector<poly> dp(N + 1);
    // 累積積の計算
    dp[M] = unit;
    for (int i = M; i > L; --i) dp[i - 1] = op(A[i - 1], dp[i]);
    for (int i = M; i < R; ++i) dp[i + 1] = op(dp[i], A[i]);
    // 答の計算
    for (auto [q, a, b]: query) {
      // 0 次だけでよいので、積を計算しきる必要はない
      poly &f = dp[a], &g = dp[b];
      mint ans = 0;
      for (int i = 0; i < K; ++i) {
        int j = (i == 0 ? 0 : K - i);
        ans += f[i] * g[j];
      }
      ans -= 1;
      ANS[q] = ans.val();
    }
  };

  auto dfs = [&](auto& dfs, int L, int R, vector<T>& query) -> void {
    if (R - L <= 1) {
      for (auto [q, a, b]: query) ANS[q] = (A[a][0].val() == 0 ? 1 : 0);
      return;
    }
    int M = (L + R) / 2;
    vector<T> query_L, query_R, other;
    for (auto [q, a, b]: query) {
      if (b <= M) query_L.emplace_back(q, a, b);
      if (M <= a) query_R.emplace_back(q, a, b);
      if (a < M && M < b) other.emplace_back(q, a, b);
    }
    calc(L, M, R, other), dfs(dfs, L, M, query_L), dfs(dfs, M, R, query_R);
  };
  dfs(dfs, 0, N, query);

  // 出力
  for (auto x: ANS) cout << x << '\n';
}

signed main() {
  ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  solve();
  return 0;
}