#include <iostream>
#include <fstream>

using namespace std;

ifstream fin("divk.in");
ofstream fout("divk.out");

int v[500001];
long long s[500001];

int main()
{
    int n, k, a, b, i, j, r = 0;
    fin >> n >> k >> a >> b;
    for(i = 1; i <= n; ++i)
    {
        fin >> v[i];
        s[i] = s[i-1] + v[i];
    }
    for(i = 1; i <= n-a+1; ++i)
    {
        for(j = i+a-1; j < i+b && j <= n; ++j)
        {
            if((s[j] - s[i-1]) % k == 0)
            {
                ++r;
            }
        }
    }
    fout << r;

    return 0;
}