#include <iostream>
#include <fstream>
#include <cstring>
#include <string>
#include <climits>
#include <algorithm>
#include <cmath>
using namespace std;

ifstream fin ("divk.in" );
ofstream fout("divk.out");
#define baza 1
#define MAX 17
#define MOD 9973
typedef long long int lli;


int n,m,k,A,B,a[MAX], nr, i, j;



int main()
{
    fin>>n>>k>>A>>B;
    for(i=1;i<=n;i++)
    {
        fin>>a[i];
        a[i]+=a[i-1];
    }
    for(i=1;i<=n-A+1;i++)
    {
        for(j=i+A-1;j<i+B && j<=n;j++)
        {
            if((a[j]-a[i-1])%k==0)
                {
                    nr++;
                }
        }
    }

    fout<<nr;



    return 0;
}