program divk;
var n,k,a,b,x,c,j,p,o1,s :longint;
var d : array[1..10000000] of longint;
var f,ff :text;
begin
assign(f,'divk.in');
reset(f);
read(f,n,k,a,b);
for c:=1 to n do
begin
readln(f,x);
d[c]:=x;
end;
close(f); c:=1;
s:=0;
for c:=1 to n-p do
begin
p:=a;
repeat
o1:=0;
if c+p-1<=n  then
begin
for j:=c to c+p-1 do
o1:=o1+d[j];
end;
if ((o1 mod k)=0) and (c+p-1<=n) then
s:=s+1;
p:=p+1;
until p=b+1;
end;
assign(ff,'divk.out');
rewrite(ff);
write(ff,s);
close(ff)
end.