#include<bits/stdc++.h>
#define int long long
#define ll long long
#define pir pair<int,int>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
using namespace std;
inline int re()
{
    int f=1,num=0;
    char c=getchar();
    while(c<'0'||c>'9'){if(c=='-') f=-1;c=getchar();}
    while(c>='0'&&c<='9') num=num*10+c-'0',c=getchar();
    return num*f;
}
int T;
void clear();
const int N=1010;
int n,x,MOD,m;
int a[N][N];
void init()
{
    a[0][0]=1;
    for(int i=1;i<=1000;i++) for(int j=1;j<=1000;j++) a[i][j]=(a[i-1][j-1]+j*a[i-1][j])%MOD;
    return;
}
int b[N];
int qpow(int a,int b=MOD-2)
{
    int mul=1;
    while(b)
    {
        if(b&1) mul=mul*a%MOD;
        b>>=1;a=a*a%MOD;
    }
    return mul;
}
void work()
{
    clear();
    n=re();x=re();MOD=re();m=re();
    init();
    for(int i=0;i<=m;i++)
    {
        int x=re();
        for(int j=0;j<=i;j++) (b[j]+=x*a[i][j]%MOD)%=MOD;
    }
    int ans=0;
    int nown=1,nowx=1;
    for(int i=0;i<=m;i++)
    {
        (ans+=b[i]*nown%MOD*nowx%MOD*qpow(x+1,n-i)%MOD)%=MOD;
        nown=nown*(n-i)%MOD;
        nowx=nowx*x%MOD;
    }
    printf("%lld\n",ans);
    return;
}
signed main()
{
    freopen("problem.in","r",stdin);
    freopen("problem.out","w",stdout);
    T=1;
    while(T--) work();
    return 0;
}
void clear()
{
    return;
}