#include <algorithm>
using namespace std;

#define DIM 500005

int s[DIM],v[DIM];
long long nrt;
int n,k,a,b;

void read ()
{
    int i,nr;

    scanf ("%d%d%d%d",&n,&k,&a,&b);
    for (i=1; i<=n; ++i)
    {
        scanf ("%d",&nr);
        s[i]=(s[i-1]+nr)%k;
        if (!s[i] && i>=a && i<=b)
            ++nrt;
    }
}

void solve ()
{
    int i;

    for (i=a; i<=n; ++i)
    {
        if (i>b+1)
            --v[s[i-b-1]];
        if (i>a)
            ++v[s[i-a]];
        nrt+=v[s[i]];
    }
    printf ("%lld",nrt);
}

int main ()
{
    freopen ("divk.in","r",stdin);
    freopen ("divk.out","w",stdout);

    read ();
    solve ();

    return 0;
}