#include <cstdio>

using namespace std;
int a,b,ci[500000],n,k,i,j,p,t;
long long c[500000];
int main()
{
    freopen("divk.in","r",stdin);
    freopen("divk.out","w",stdout);
    scanf("%d%d%d%d",&n,&k,&a,&b);
    p=0;
    for(i=1;i<=n;i++)
    {
        p++;
        scanf("%lld",&c[p]);
        ci[p]++;
        for(j=1;j<p;j++)
        {
            c[j]=c[j]+c[p];
            ci[j]++;
            if((c[j]%k==0)&&(ci[j]>=a))
                t++;
        }
        if(p==b+1)
        {
            c[1]=c[p];
            p=1;
            ci[1]=1;
        }
    }
    printf("%d",t);
    return 0;
}