#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>
#include <stack>
#include <atcoder/modint>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}

using mint = atcoder::modint998244353;

ostream& operator<<(ostream& os, const mint& m){
    os << m.val();
    return os;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int n, m, k; cin >> n >> m >> k;
    vector<int> a(n);
    for(int i = 0; i < n; i++) cin >> a[i];
    stack<int> stack_left, stack_right;
    auto dp = vec2d(n, k, mint(0));
    vector<mint> e(k); e[0] = 1;
    auto right_top = [&](){
        if(stack_right.empty()) return &e;
        return &dp[stack_right.top()];
    };
    auto push_left = [&](int i){
        dp[i].assign(k, mint(0));
        auto &v = stack_left.empty() ? e : dp[stack_left.top()];
        for(int j = 0; j < k; j++){
            dp[i][j] += v[j];
            dp[i][(j+a[i])%k] += v[j];
        }
        stack_left.push(i);
    };
    auto push_right = [&](int i){
        dp[i].assign(k, mint(0));
        auto &v = stack_right.empty() ? e : dp[stack_right.top()];
        for(int j = 0; j < k; j++){
            dp[i][j] += v[j];
            dp[i][(j+a[i])%k] += v[j];
        }
        stack_right.push(i);
    };
    auto pop = [&](){
        if(stack_left.empty()){
            while(!stack_right.empty()){
                int i = stack_right.top(); stack_right.pop();
                push_left(i);
            }
        }
        stack_left.pop();
    };
    auto ans = [&](){
        auto &v = stack_left.empty() ? e : dp[stack_left.top()];
        auto &u = stack_right.empty() ? e : dp[stack_right.top()];
        mint ret = 0;
        for(int i = 0; i < k; i++){
            ret += v[i]*u[(k-i)%k];
        }
        return ret;
    };
    for(int i = 0; i < m; i++) push_right(i);
    for(int i = m; i < n; i++){
        cout << ans()-1 << endl;
        push_right(i);
        pop();
    }
    cout << ans()-1 << endl;
}