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