#include <iostream>
#include <fstream>
using namespace std;
int main()
{int n,i,k,a,b,c=0,s,u,j;
int long long t[50000];
ifstream f("divk.in");
ofstream g("divk.out");
f>>n>>k>>a>>b;
for (i=1;i<=n;i++) f>>t[i];
for (i=1;i<=n;i++)
{s=0;
u=a;
while ((u<=b)&&((i+u-1)<=n))
{s=0;
for (j=i;j<=(i+u-1);j++) s=s+t[j];
if (s%k==0) c=c+1;
u=u+1;}
}
g<<c;
f.close();
g.close();
return 0;
}