#include <fstream>
#define MAXN 500001
using namespace std;
ifstream fi("divk.in");
ofstream fo("divk.out");

int S[MAXN],n,k,A,B,i,nr,inceput,fin,sum,rez;
int main()
{
    fi>>n>>k>>A>>B;
    for (i=1; i<=n; i++)
    {
        fi>>nr;
        S[i]=(S[i-1]+nr)%k;
    }
    for (inceput=1; inceput+A-1<=n; inceput++)
        for (fin=inceput+A-1; fin<=n&&fin-inceput+1<=B; fin++)
        {
            sum=S[fin]-S[inceput-1];
            while (sum<0)
                sum+=k;
            if (sum==0)
                rez++;
        }
    fo<<rez;
    fi.close();
    fo.close();
    return 0;
}

/*#include <fstream>
#include <cstdlib>
#include <ctime>
using namespace std;
ofstream fo("divk.in");

int main()
{
    srand(time(NULL));
    fo<<"500000 7 1 500000\n";
    for (int i=1; i<=500000; i++)
        fo<<rand()%10000000;
}*/