#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#define N 1005
#define int long long
#define fo(i,l,r) for(int i=l;i<=r;i++)
#define rf(i,r,l) for(int i=r;i>=l;i--)
using namespace std;
int n,m,p,C[N][N],a[N],ans,x[N],y,z;
void swap(int &x,int &y){int t=x;x=y;y=t;}
int max(int x,int y){return x>y?x:y;}
int min(int x,int y){return x<y?x:y;}
void init(){
    fo(i,0,n)
    {
        C[i][0]=C[i][i]=1%p;
        fo(j,1,i-1)C[i][j]=(C[i-1][j]+C[i-1][j-1])%p;
    }
}
int f(int k)
{
    int sum=0;
    rf(i,m,0)sum=sum*k+a[i];
    return sum;
}
int read(){
    int sum=0;bool f=0;char c=getchar();
    for(;c<48||c>57;c=getchar())if(c==45)f=1;
    for(;c>=48&&c<=57;c=getchar())sum=sum*10+(c&15);
    return f?-sum:sum;
}
signed main(){
    freopen("problem.in","r",stdin);freopen("problem.out","w",stdout);
    n=read();x[1]=read();p=read();m=read();
    fo(i,0,m)a[i]=read();
    x[0]=1;fo(i,2,n)x[i]=x[i-1]*x[1]%p;
    init(); 
    fo(k,0,n)
    {
        ans+=f(k)*x[k]%p*C[n][k]%p;
        if(ans>=p)ans-=p;
    }
    printf("%lld",ans);
    return 0;
}