ll n,m,a[],k,p,ans,fac[maxn],inv[maxn];

 inline ll c(ll n,ll m)

 {

     if(n<m)return ;

     if(n<p&&m<p)return fac[n]*inv[m]%p*inv[n-m]%p;

     return c(n%p,m%p)*c(n/p,m/p)%p;

 }

 inline void dfs(int x,int w1,ll w2)

 {

     if(x==k+){ans=(ans+w1*(c(m+n-w2,n)-c(n-w2-,n)))%p;return;}//cout<<n<<' '<<m<<' '<<w2<<' '<<n+m-w2<<' '<<n<<' '<<ans<<endl;return;}

     dfs(x+,-w1,w2+a[x]+);

     dfs(x+,w1,w2);

 }

 int main()

 {

     freopen("input.txt","r",stdin);

     freopen("output.txt","w",stdout);

     n=read();k=read();m=read();p=read();

     fac[]=;

     for1(i,p-)fac[i]=fac[i-]*i%p;

     inv[]=inv[]=;

     for2(i,,p-)inv[i]=inv[i-p%i]*(p/i+)%p;

     for1(i,p-)inv[i]=inv[i]*inv[i-]%p;

     for1(i,k)a[i]=read();

     dfs(,,);

     cout<<(ans+p)%p<<endl;

     return ;

 }