#include <bits/stdc++.h>
using namespace std;
#define N 500001
long long v[N];
int main()
{
    FILE *in, *out;
    in = fopen("divk.in", "r");
    out = fopen("divk.out", "w");
    int n, m, i, j, nr = 0, x, y, ii, cp, k, a, b;
    fscanf(in, "%d%d%d%d",&n,&k,&a,&b);
    for(i = 1;i <= n;i++){
        fscanf(in, "%d",&v[i]);
        v[i] += v[i - 1];
    }
    for(i = 1;i <= n - a + 1;i++){
        for(j = i + a - 1;j <= i + b - 1 && j <= n;j++){
            if((v[j] - v[i - 1]) % k == 0){
                nr++;
            }
        }
    }
    fprintf(out, "%d",nr);
    return 0;
}