program divk;
 var n,k,a,b,i,j,t,s,l:longint;
      c:array [1..500000] of longint;
     fi, fo:text;
begin
 assign(fi,'divk.in');
  reset(fi);
   readln(fi,n,k,a,b);
  for i:=1 to n do
   readln(fi,c[i]);
 assign(fo,'divk.out');
  rewrite(fo); j:=1;
 for i:=b downto a do begin
  while j<=n-i+1 do begin
   for l:=j to j+i-1 do
    s:=s+c[l];
   if s mod k=0 then inc(t);
   inc(j); s:=0;
  end;
  j:=1;
  end;
  write(fo,t);
  close(fo);
 end.