#include<bits/stdc++.h>
#define int long long
using namespace std;
int n,x,p,m,a[1005],C[2005][2005],ans;
int qpow(int a,int b){
	int ans=1;
	a%=p;
	while(b) {
		if(b&1)ans=(ans%p)*(a%p)%p;
		b/=2;
		a=(a%p)*(a%p)%p;
	}
	ans%=p;
	return ans;
}
signed main(){
    freopen("problem.in","r",stdin);
    freopen("problem.out","w",stdout);
    cin>>n>>x>>p>>m;
    for(int i=0;i<=m;i++){
        cin>>a[i];
    }
    if(m==0){
        ans=a[0]%p*qpow(x+1,n)%p;
        cout<<ans;
        return 0; 
    }
    C[0][0]=1;
    for(int i=1;i<=n;i++){
        C[i][0]=1;
        for(int j=1;j<=i;j++){
            C[i][j]=(C[i-1][j-1]+C[i-1][j])%p;
        }
    }
    int px=1;
    for(int k=0;k<=n;k++){
        int fk=0,pk=1; 
        for(int i=0;i<=m;i++){
            fk=(fk+a[i]*pk)%p;
            pk=pk*k%p;
        }
        int sum=fk*px%p;   
        sum=sum*C[n][k]%p;
        ans=(ans+sum)%p;
        px=px*x%p;
    }
    cout<<ans;
    return 0;
}