#include <stdio.h>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf32 1000000001
#define Inf64 1000000000000000001


int main(){
	int N,M,K;
	cin>>N>>M>>K;
	vector<int> a(N);
	rep(i,N)cin>>a[i];
	for(int i=M-1;i<N;i+=M){
		
		vector ldp(M+1,vector<mint>(K,0));
		ldp[0][0] = 1;
		rep(j,M){
			int A = a[i-j];
			rep(k,K){
				ldp[j+1][k] += ldp[j][k];
				ldp[j+1][(k+A)%K] += ldp[j][k];
			}
		}
				
		
		vector<mint> rdp(K,0);
		rdp[0] = 1;
		int cur = i+1;
		while(ldp.size()>0){
			mint ans = 0;
			rep(j,K){
				ans += ldp.back()[j] * rdp[(K-j)%K];
			}
			cout<<(ans-1).val()<<endl;
			ldp.pop_back();
			if(cur>=N)break;
			vector<mint> ndp(K,0);
			rep(j,K){
				ndp[j] += rdp[j];
				ndp[(j+a[cur])%K] += rdp[j];
			}
			swap(ndp,rdp);
			cur++;
		}
	}
	
	return 0;
}