#include <cstdio>
using namespace std;

long long x, ct;
int v[500002], n, k, a, b;

int main ()
{
    freopen ("divk.in", "r", stdin);
    freopen ("divk.out", "w", stdout);

    scanf ("%d %d %d %d", &n, &k, &a, &b);

    for (int i=1; i<=n; i++){
        scanf ("%lld", &x);
        x += v[i-1];
        v[i] = (long long) x % k;

        for (int j=a; j<=b && i-j>=0; j++){
            if (v[i] == v[i-j]){
                ct ++;
            }
        }

    }

    printf ("%lld", ct);

    return 0;
}