#include <iostream>
#include <fstream>

using namespace std;


int main()
{
    int N,a[100001],contor=0,k,A,B,s[1000001];
    ifstream fin ("divk.in");
    ofstream fout ("divk.out");
    fin >> N >> k >> A >> B;
    s[0]=0;
    for(int i=1;i<=N;i++)
    {
        fin >> a[i];
        s[i]=a[i]+s[i-1];
    }
    for(int i=A;i<=B;i++)
    {
        for(int z=1;z<=N-i+1;z++)
        {
            if((s[z+i-1]-s[z-1])%k==0)
                contor++;
        }
    }
    fout << contor;
    fin.close();
    fout.close();
}