#include <cstdio>
#include <queue>
using namespace std;

int v[500005];
int ap[500005];

queue < int > Q;

int main()
{

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

    int n, i, j, t, d, a, b, k;
    long long s  = 0;

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

    for( i = 1; i <= n; ++i ){
        scanf("%d",&t);
        v[i] = ( v[i-1] + t ) % k;
        if( i >= a ) ap[v[i-a]]++;
        if( i > b ) ap[v[i-b-1]]--;
        s += ap[v[i]];

    }


    printf("%lld",s);

    return 0;
}