#include <fstream>
using namespace std;
int main ()
{
    ifstream f("divk.in");
    ofstream g("divk.out");
    long long v[260001],n,k,a,b,i,j,s,cont=0,l;
    f>>n>>k>>a>>b;
    for (i=1; i<=n; i++)
    f>>v[i];
    for (i=1; i<=n-1; i++)
    for (j=i+1; j<=n; j++)
    if (j-i>=a-1 && j-i<=b-1)
    {
        s=0;
        for (l=i; l<=j; l++)

    s+=v[l];
            if (s%k==0)
            cont++;
    }

    g<<cont;
    return 0;
}