#include <bits/stdc++.h>
using namespace std;
const long long MOD = 998244353;
int main(){
  int N, M, K;
  cin >> N >> M >> K;
  vector<int> A(N);
  for (int i = 0; i < N; i++){
    cin >> A[i];
  }
  int N2 = (N + M - 1) / M * M;
  for (int i = 0; i < N2 - N; i++){
    A.push_back(0);
  }
  int P = N2 / M;
  vector<long long> ans(N2 - M + 1, 0);
  for (int i = 0; i < P - 1; i++){
    vector<vector<long long>> dpR(M + 1, vector<long long>(K, 0));
    dpR[M][0] = 1;
    for (int j = M - 1; j >= 0; j--){
      for (int k = 0; k < K; k++){
        dpR[j][k] += dpR[j + 1][k];
        dpR[j][k] %= MOD;
        int k2 = (k + A[i * M + j]) % K;
        dpR[j][k2] += dpR[j + 1][k];
        dpR[j][k2] %= MOD;
      }
    }
    vector<vector<long long>> dpL(M + 1, vector<long long>(K, 0));
    dpL[0][0] = 1;
    for (int j = 0; j < M; j++){
      for (int k = 0; k < K; k++){
        dpL[j + 1][k] += dpL[j][k];
        dpL[j + 1][k] %= MOD;
        int k2 = (k + A[(i + 1) * M + j]) % K;
        dpL[j + 1][k2] += dpL[j][k];
        dpL[j + 1][k2] %= MOD;
      }
    }
    for (int j = 0; j <= M; j++){
      ans[i * M + j] = 0;
      for (int k = 0; k < K; k++){
        ans[i * M + j] += dpR[j][k] * dpL[j][(K - k) % K];
        ans[i * M + j] %= MOD;
      }
    }
  }
  for (int i = 0; i <= N - M; i++){
    cout << (ans[i] + MOD - 1) % MOD << endl;
  }
}