#include<stdio.h>
#include<algorithm>

using namespace std;


long long  s[500001];
int i,j,k,m,u,n,x,y;

int main()
{
    freopen("divk.in","r",stdin);
    freopen("divk.out","w",stdout);
    scanf("%d%d%d%d",&n,&k,&x,&y);
    int val;
    for (i=1; i<=n; ++i)
    {
            scanf("%d",&val);
            s[i]=s[i-1]+val;
    }
    int sol=0;
    //printf("%d",y);
    for (i=1; i<=n; ++i)
    {
        for (j=i+x-1; j<=min(i+y-1,n); ++j) //printf("%d\n",s[j]-s[i-1]);
           if ((s[j]-s[i-1])%k==0)
                                {
                                    ++sol;
                                    //printf("%d %d \n",i,j);
                                }
    }
    printf("%d",sol);
    return 0;
}