#include <fstream>
#include <iostream>

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

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

    return 0;
}