#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
int n,i,j,k,v[500005],a,b,rez;
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",&rez),v[i]=v[i-1]+(rez%k);
	rez=0;
	for (i=1;i<=n;i++)
		for (j=i+a-1;j<=i+b-1 && j<=n;j++) if ((v[j]-v[i-1])%k==0) rez++; 
	printf("%d\n",rez);
	return 0;
}