#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
using ll=long long;

ll garner(vector<ll>&r,vector<ll>&m,vector<vector<ll>>&b,int M){
	int n=r.size();
	vector<ll>k(n);
	for(int i=0;i<n;i++){
		modint::set_mod(m[i]);
		modint a=0;
		for(int j=0;j<i;j++)a+=b[i][j]*k[j];
		k[i]=((r[i]-a+m[i])/b[i][i]).val();
	}
	modint::set_mod(M);
	modint a=0;
	for(int i=0;i<n;i++)a+=b[n][i]*k[i];
	return a.val();
}

int S;
vector<int>A;

vector<ll> solve(int P,int c){
	modint::set_mod(P);
	modint g=internal::primitive_root_constexpr(P);
	modint z=g.pow(P/c);

	vector<ll>ans(S+1);
	modint zeta=1;
	for(int zeta_i=0;zeta_i<c;zeta_i++,zeta*=z){
		vector<modint>temp(S+1);
		temp[0]=1;
		int sum=0;
		for(int i=0;i<A.size();i++){
			for(int j=sum;j>=0;j--)temp[j+A[i]]+=temp[j]*zeta;
			sum+=A[i];
		}
		for(int i=0;i<=S;i++)ans[i]+=temp[i].val();
	}
	int invc=(modint(1)/c).val();
	for(int i=0;i<=S;i++)ans[i]=ans[i]%P*invc%P;
	ans[0]=0;
	return ans;
}

const int n_mod=3;

int main(){
	int N,C,mod;
	cin >> N >> mod >> C;
	A.resize(N);
	for(int i=0;i<N;i++)cin >> A[i];
	for(int i=0;i<N;i++)S+=A[i];
	int CC=2*C>=N?C:N-C;

	int P=1000000000/CC*CC+1;
	vector<ll>Ps(n_mod);
	vector<vector<ll>>ans(n_mod);
	for(int i=0;i<n_mod;i++,P+=CC){
		while(!internal::is_prime_constexpr(P))P+=CC;
		Ps[i]=P;
		ans[i]=solve(P,CC);
	}
	
	Ps.push_back(mod);
	vector<vector<ll>>b(n_mod+1);
	b[0].push_back(1);
	for(int i=1;i<n_mod+1;i++){
		b[i].push_back(1);
		for(int j=0;j<i;j++)b[i].push_back(b[i].back()*Ps[j]%Ps[i]);
	}

	for(int i=1;i<=S;i++){
		vector<ll>r(n_mod);
		for(int j=0;j<n_mod;j++)r[j]=ans[j][2*C>=N?i:S-i];
		ll ret=garner(r,Ps,b,mod);
		if(i==S&&2*C==N)ret=(ret-1+mod)%mod;
		if(i!=1)cout << ' ';
		cout << ret;
	}
	cout << '\n';
}