#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int maxn=505;
ll n,m,p;
ll s1[maxn+5],s2[maxn+5],s3[maxn+5],s4[maxn+5],s5[maxn+5];
ll s6[maxn+5],s7[maxn+5],s8[maxn+5],s9[maxn+5],s10[maxn+5],ans[maxn+5],iv[maxn+5];
int main(){
    int i,j,k;
    ll cur;
    scanf("%lld%lld%lld",&n,&m,&p);
    iv[1]=1;
    for(i=2;i<=n;i++)iv[i]=(p-p/i)*iv[p%i]%p;
    for(i=1;i<=n;i++)scanf("%lld",&s1[i]);
    for(i=1;i<=n;i++){
        for(j=1;j<=n-i;j++){
            s2[i+j]=(s2[i+j]+s1[i]*s1[j])%p;
        }
    }
    s3[0]=1;
    for(i=1;i<=n;i++)s3[i]=s2[i];
    s4[0]=1;
    for(i=1;i<=n;i++){
        cur=0;
        for(j=0;j<i;j++)cur=(cur+s4[j]*s3[i-j])%p;
        s4[i]=(p-cur)%p;
    }
    for(i=1;i<=n;i++)s5[i-1]=s1[i]*i%p;
    for(i=0;i<n;i++){
        for(j=0;j<n-i;j++){
            s6[i+j]=(s6[i+j]+s5[i]*s4[j])%p;
        }
    }
    for(i=1;i<=n;i++)s7[i]=s6[i-1]*iv[i]%p;
    cur=m%p;
    for(i=1;i<=n;i++)s8[i]=s7[i]*cur%p;
    for(i=1;i<=n;i++)s9[i-1]=s8[i]*i%p;
    s10[0]=1;
    for(i=1;i<=n;i++){
        if(i>1){
            cur=0;
            for(j=1;j<i-1;j++)cur=(cur+ans[j]*ans[i-1-j])%p;
            s10[i-1]=cur;
        }
        cur=0;
        for(j=0;j<i;j++)cur=(cur+s9[j]*s10[i-1-j])%p;
        ans[i]=cur*iv[i]%p;
    }
    for(i=1;i<=n;i++)printf("%lld%c",ans[i],i==n?'\n':' ');
    return 0;
}