#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("divk.in");
ofstream fout("divk.out");

const int Nmax=500005;

int N,K,A,B,D[Nmax],M,P,S;


void Read()
{
    fin>>N>>K>>A>>B;
    for(int i=1;i<=N;++i )
    {
        int x;
        fin>>x;
        D[i]=x%K;
    }
}


void Solve()
{
for(int i=1;i<=N;++i )
    {
        for(int j=1;j<=N-i+1;++j)
    {
       if(j==1)
       {
           M=D[i];
           P=M;
       }
       else
       {
           M=(P+D[j+i-1])%K;
           P=M;
       }
       int y;
       if(j>i)
       {
           y=j-i;
       }
       else
       {
           y=i-j;
       }

       if((y+1>=A) && (y+1<=B) && (M==0))
       {
           S++;
       }
    }
    }
    fout<<S<<"\n";
}




int main()
{
    Read();
    Solve();

    return 0;
}