#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define ALL(x) (x).begin(), (x).end()
#ifdef LOCAL
#include "debug.hpp"
#else
#define debug(...) void(0)
#endif

template <typename T> istream& operator>>(istream& is, vector<T>& v) {
    for (T& x : v) is >> x;
    return is;
}
template <typename T> ostream& operator<<(ostream& os, const vector<T>& v) {
    for (size_t i = 0; i < v.size(); i++) {
        os << v[i] << (i + 1 == v.size() ? "" : " ");
    }
    return os;
}

template <typename T> T gcd(T x, T y) { return y != 0 ? gcd(y, x % y) : x; }
template <typename T> T lcm(T x, T y) { return x / gcd(x, y) * y; }

int topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }
int topbit(long long t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }
int botbit(signed a) { return a == 0 ? 32 : __builtin_ctz(a); }
int botbit(long long a) { return a == 0 ? 64 : __builtin_ctzll(a); }
int popcount(signed t) { return __builtin_popcount(t); }
int popcount(long long t) { return __builtin_popcountll(t); }
bool ispow2(int i) { return i && (i & -i) == i; }
long long MSK(int n) { return (1LL << n) - 1; }

template <class T> T ceil(T x, T y) {
    assert(y >= 1);
    return (x > 0 ? (x + y - 1) / y : x / y);
}
template <class T> T floor(T x, T y) {
    assert(y >= 1);
    return (x > 0 ? x / y : (x - y + 1) / y);
}

template <class T1, class T2> inline bool chmin(T1& a, T2 b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template <class T1, class T2> inline bool chmax(T1& a, T2 b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template <typename T> void mkuni(vector<T>& v) {
    sort(v.begin(), v.end());
    v.erase(unique(v.begin(), v.end()), v.end());
}
template <typename T> int lwb(const vector<T>& v, const T& x) { return lower_bound(v.begin(), v.end(), x) - v.begin(); }

const int INF = (1 << 30) - 1;
const long long IINF = (1LL << 60) - 1;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const int MOD = 998244353;
// const int MOD = 1000000007;

#include <iostream>
#include "atcoder/modint"

namespace atcoder {

template <int MOD> std::istream& operator>>(std::istream& is, static_modint<MOD>& x) {
    int64_t v;
    x = static_modint<MOD>{(is >> v, v)};
    return is;
}

template <int MOD> std::ostream& operator<<(std::ostream& os, const static_modint<MOD>& x) { return os << x.val(); }

template <int ID> std::ostream& operator<<(std::ostream& os, const dynamic_modint<ID>& x) { return os << x.val(); }

}  // namespace atcoder

#include <functional>
#include <stack>

template <typename Monoid> struct SlidingWindowAggregation {
    typedef std::function<Monoid(Monoid, Monoid)> F;
    std::stack<std::pair<Monoid, Monoid>> front_stack, back_stack;
    F f;
    Monoid id;
    SlidingWindowAggregation(F f, Monoid id) : f(f), id(id), front_stack(), back_stack() {
        front_stack.emplace(id, id);
        back_stack.emplace(id, id);
    }
    void push(const Monoid& x) { back_stack.emplace(x, f(back_stack.top().second, x)); }
    void pop() {
        if (front_stack.size() == 1) {
            while (1 < (int)back_stack.size()) {
                Monoid t = back_stack.top().first;
                Monoid calc = f(t, front_stack.top().second);
                front_stack.emplace(t, calc);
                back_stack.pop();
            }
        }
        front_stack.pop();
    }
    Monoid fold() { return f(front_stack.top().second, back_stack.top().second); }
};

using mint = atcoder::modint998244353;

struct S {
    int val;
    vector<mint> dat;
    S(int val, vector<mint> dat) : val(val), dat(dat) {}
};

#include "atcoder/convolution"

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N, M, K;
    cin >> N >> M >> K;
    vector<int> A(N);
    cin >> A;

    auto f = [&](S l, S r) {
        if (l.val == -1) return r;
        if (r.val == -1) return l;
        if (l.val == -2 and r.val == -2) {
            vector<mint> ndat(K, 0);
            for (int i = 0; i < K; i++) ndat[0] += l.dat[i] * r.dat[(K - i) % K];
            return S(-2, ndat);
        }
        if (0 <= l.val) swap(l, r);
        vector<mint> ndat(K, 0);
        for (int i = 0; i < K; i++) {
            ndat[i] += l.dat[i];
            ndat[(i + r.val) % K] += l.dat[i];
        }
        return S(-2, ndat);
    };
    vector<mint> init(K, 0);
    init[0]++;
    SlidingWindowAggregation<S> SWAG(f, S(-1, init));
    for (int i = 0; i < M; i++) {
        vector<mint> tmp(K, 0);
        tmp[0]++;
        tmp[A[i]]++;
        SWAG.push(S(A[i], tmp));
    }
    for (int i = M, j = 0;; i++, j++) {
        cout << SWAG.fold().dat[0] - 1 << '\n';
        if (i == N) break;
        vector<mint> tmp(K, 0);
        tmp[0]++;
        tmp[A[i]]++;
        SWAG.push(S(A[i], tmp));
        SWAG.pop();
    }
    return 0;
}