#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("divk.in");
ofstream fout("divk.out");
int n,k,nr1,nr2,nr;
int a[500005];
long long s[500005];
int main()
{
    int i,j;
fin>>n>>k>>nr1>>nr2;
for(i=1;i<=n;i++)
    {fin>>a[i];
    s[i]=a[i]+s[i-1];
    }
for(i=1;i<=n;i++)
    for(j=i+nr1-1;j<=i+nr2-1;j++)
        if(j<=n)
            if((s[j]-s[i-1])%k==0)
                nr++;
fout<<nr;
    return 0;
}