#include <bits/stdc++.h>
//#define int long long
using namespace std;
ifstream in ("divk.in");
ofstream out ("divk.out");
int v[500005];
int sp[500005];
int f[200005];
int32_t main()
{
    int n,k,a,b;
    //fscanf(in,"%d %d %d %d",&n,&k,&a,&b);
    in>>n>>k>>a>>b;
    for(int i=1;i<=n;++i)
    {
        //fscanf(in,"%d",&v[i]);
        in>>v[i];
        sp[i]=(sp[i-1]+v[i])%k;
    }
    long long ans=0;
    for(int i=a;i<=b;++i)
    {
        f[sp[i-a]]++;
        if(i>=a)ans +=1LL*(f[sp[i]]);
    }
    int lost=1;
    for(int i=b+1;i<=n;++i)
    {
        f[sp[i-a]]++;
        f[sp[i-b-1]]--;
        ans+=1LL*(f[sp[i]]);
    }
    //fprintf(out,"%lld",ans);
    out<<ans;
    return 0;
}