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

const ll N=2e6+100;

ll n,x,p,m;
ll a[1200];
ll fac[N+100],inv[N+100];
ll fk,ans;

ll mpow(ll aa,ll bb){
	ll res=1;
	while (bb){
		if (bb&1) res=res*aa%p;
		aa=aa*aa%p;
		bb>>=1;
	}
	return res;
}

ll C(ll aa,ll bb){
	if (aa<bb||aa<0||bb<0) return 0;
	return fac[aa]*inv[bb]%p*inv[aa-bb]%p;
}

int main(){
	freopen("problem.in","r",stdin);
	freopen("problem.out","w",stdout);
	ios::sync_with_stdio(0);
	cin.tie(0);cout.tie(0);
	cin>>n>>x>>p>>m;
	for (int i=0;i<=m;i++){
		cin>>a[i];
	}
	fac[0]=1;
	for(int i=1;i<=N;i++) fac[i]=(fac[i-1]*i)%p;
	for(int i=0;i<=N;i++) inv[i]=mpow(fac[i],p-2);
	for (int k=0;k<=n;k++){
		fk=0;
		for (int i=0;i<=m;i++){
			fk+=a[i]*mpow(k,i)%p;
			fk%=p;
		}
		ans+=fk*mpow(x,k)%p*C(n,k)%p;
		ans%=p;
	}
	cout<<ans;
	return 0;
}