#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1e3+10;
ll n,x,p,m,a[N],ans;

ll qp(ll a,ll b){
    ll res=1;
    while(b){
        if(b&1)res=(res*a)%p;
        a=(a*a)%p;
        b>>=1;
    }
    return res%p;
}
ll f(ll k){
    ll res=0;
    for(int i=0;i<=m;i++){
       res=(res+(a[i]%p*qp(k,i)%p))%p; 
    }
    return res%p;
}
ll g(ll k){
    ll res=1;
    for(int i=1;i<=k;i++){
        res=(res*i)%p;
    }
    return res%p;
}
ll cc(ll a,ll b){
    return ((g(a)%p)/((((g(b)%p)*(g(a-b)%p))%p)%p))%p;
}
ll work(ll k){
    return (((f(k)*qp(x,k))%p)*cc(n,k))%p;
}
int 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];
    for(int i=0;i<=n;i++){
        ll tmp=work(i);
        ans=(ans+tmp)%p;
        
    }
    cout<<ans<<endl;
    return 0;
}