#include <iostream>
#include <fstream>
#define Maxx 500001
using namespace std;
ifstream fin("divk.in");
ofstream fout("divk.out");
long long S[Maxx];
int n,a,b,k,i,j,ans;
int main()
{
    fin>>n>>k>>a>>b;
    for (i=1;i<=n;i++)
    {
        fin>>j;
        S[i]=S[i-1]+j;
    }
    for (i=1;i<=n-a+1;i++)
    {
        j=a;
        while (S[i+j]%k!=0 && j<=b) j++;
        if (S[i+j]%k==0) ans++;
    }
    fout<<ans-1;
    return 0;
}