#include <cstdio>
#include <algorithm>
#define Dim  500001

using namespace std;
int n,k,a,b,i,j,x,sol;
long long c[Dim];
int main()
{
    freopen("divk.in","r",stdin);
    freopen("divk.out","w",stdout);
    scanf("%d %d %d %d",&n,&k,&a,&b);
    for(i=1;i<=n;i++)
    {
        scanf("%d",&x);
        c[i]=c[i-1]+x;
    }
    for(i=1;i<=n-a+1;i++)
    {
        if(i==4)
        i=i;
        if(i<=n-b+1)
        {
            for(j=(i+a-1);j<=(i+b-1);j++)
            if((c[j]-c[i-1])%k==0) sol++;
        }
        else
        {
            for(j=(i+a-1);j<=n;j++)
            if((c[j]-c[i-1])%k==0) sol++;
        }
    }
    printf("%d",sol);
    return 0;
}