#include<cstdio>
using namespace std;
int main()
{int n,k,a,b,s[500000],i,q,j;
long x;
FILE *f=fopen("divk.in","r");
FILE *g=fopen("divk.out","w");
fscanf(f,"%d%d%d%d",&n,&k,&a,&b);
q=0;
s[0]=0;
for(i=1;i<=n;++i)
    {fscanf(f,"%d",&x);
s[i]=x+s[i-1];}
for(i=0;i<=n-1;++i)
    {for(j=i+a;j<=i+b&&j<=n;++j)
        if((s[j]-s[i])%k==0)
            ++q; }
fprintf(g,"%d",q);
fclose(f);
fclose(g);
return 0;
}