#include<fstream>
#include<math.h>
#include<algorithm>
using namespace std;
ifstream fi("divk.in");
ofstream fo("divk.out");
long long A[500001],B[5000001],i,j,n,p=1,d,x,mi,k,a,b;
int main()
{fi>>n>>k>>a>>b;
for(i=1;i<=n;i++)
    fi>>A[i];
    for(i=1;i<=n;i++)
        B[i]=B[i-1]+A[i];
    for(i=1;i<=n;i++)
        for(j=i-b+1;j<=i-a+1;j++)
        if((B[i]-B[j-1])%k==0)
        x++;
    fo<<x;}