#include <fstream>

using namespace std;

ifstream f("divk.in");
ofstream g("divk.out");

int x[500000], n, k, a, b, i, j;
unsigned long long s[500000];
unsigned sol;

int main() {
    f >> n >> k >> a >> b;
    for (i = 1; i <= n; i++) {
        f >> x[i];
        s[i] = s[i-1]+x[i];
    }
    for (i = a; i <= b; i++)
        for (j = 1; j+i-1 <= n; j++)
            if ((s[j+i-1]-s[j-1])%k==0)
                sol++;
    g << sol;
    return 0;
}