#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#define N 1000005
#define int long long
#define fo(i,l,r) for(int i=l;i<=r;i++)
#define rf(i,r,l) for(int i=r;i>=l;i--)
using namespace std;
int n,m,p,k,r,fac[N],inv[N],ans,x,y,z;
void swap(int &x,int &y){int t=x;x=y;y=t;}
int max(int x,int y){return x>y?x:y;}
int min(int x,int y){return x<y?x:y;}
int fp(int a,int n,int p)
{
    int ans=1;
    while(n)
    {
        if(n&1)ans=ans*a%p;
        a=a*a%p;
        n>>=1;
    }
    return ans;
}
int C(int n,int m)
{
    if(!m)return 1;
    if(n<m)return 0;
    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;
}
int read(){
    int sum=0;bool f=0;char c=getchar();
    for(;c<48||c>57;c=getchar())if(c==45)f=1;
    for(;c>=48&&c<=57;c=getchar())sum=sum*10+(c&15);
    return f?-sum:sum;
}
signed main(){
    freopen("problem.in","r",stdin);freopen("problem.out","w",stdout);
    n=read();p=read();k=read();r=read();n*=k;
    if(k==1)return !printf("%lld",fp(2,n,p));
    if(k==2)return !printf("%lld",fp(2,n-1,p));
    m=min(n,p-1);
    fac[0]=inv[0]=1;fo(i,1,m)fac[i]=fac[i-1]*i%p;
    inv[m]=fp(fac[m],p-2,p);rf(i,m-1,1)inv[i]=inv[i+1]*(i+1)%p;
    for(;r<=n;r+=k)
    {
        ans+=C(n,r);
        if(ans>=p)ans-=p;
    }
    printf("%lld",ans);
    return 0;
}