#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <atcoder/modint>
using namespace std;
using i32 = int;
using u32 = unsigned int;
using i64 = long long;
using u64 = unsigned long long;
#define rep(i,n) for(int i=0; i<(int)(n); i++)
const i64 INF = 1001001001001001001;

using Modint = atcoder::static_modint<998244353>;


int main(){
    int N,M,K; cin >> N >> M >> K;
    vector<int> A(N); rep(i,N) cin >> A[i];
    using node = vector<Modint>;
    node dp(K);
    dp[0] = 1;
    auto E = [&]() -> node { node res(K); res[0] = 1; return res; };
    auto inc = [&](const node& v, int x) -> node {
        node res = v;
        rep(i,K) {
            int j = i + x; if(j >= K) j -= K;
            res[j] += v[i];
        }
        return res;
    };
    vector<Modint> ans(N-M+1);
    for(int s=0; s<=N-M; s+=M+1){
        int Z = min(M, N-M-s);
        vector<node> QL(M+1), QR(Z+1);
        QL[M] = E();
        for(int i=M-1; i>=0; i--) QL[i] = inc(QL[i+1], A[s+i]);
        QR[0] = E();
        rep(i,Z) QR[i+1] = inc(QR[i], A[s+M+i]);
        rep(i,Z+1){
            Modint q = 0;
            rep(j,K) q += QL[i][j?K-j:0] * QR[i][j];
            ans[s+i] = q - 1;
        }
    }
    rep(i,N-M+1) cout << ans[i].val() << '\n';
    return 0;
}



struct ios_do_not_sync{
    ios_do_not_sync(){
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
    }
} ios_do_not_sync_instance;