#include <bits/stdc++.h>

using namespace std;

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

int n, k, a, b, sol;
vector <int> v;

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