#include <bits/stdc++.h>

using namespace std;
int ap[500000];
int v[500000];
int f[10000002];
ifstream in("divk.in");
ofstream out("divk.out");
int main()
{
    long long n,k,a,b,i,ans=0;
    in>>n>>k>>a>>b;
    for(i=1;i<=n;i++)
    {
        in>>v[i];
        ap[i]=(ap[i-1]+v[i])%k;
    }
    for(i=a;i<=b;i++)
    {
        f[ap[i-a]]++;
        if(i>=a)
            ans+=f[ap[i]];
    }
    for(i=b+1;i<=n;++i)
    {
        f[ap[i-a]]++;
        f[ap[i-b-1]]--;
        ans+=f[ap[i]];
    }
    out<<ans;
    return 0;
}