program ps2;
var   n,k,j,i,p,max,a,b,s:longint;
     v:array[1..25000]of integer;f,g:text;
begin
     assign(f,'secv2.in');reset(f);
     assign(g,'secv2.out');rewrite(g);
       read(f,n);readln(f,k);max:=-maxint;
     for i:=1 to n do read(f,v[i]);
      for i:=1 to n-k do begin
         p:=i+k-1;   repeat
        for j:=i to p do
          s:=s+v[j];
              p:=P+1;
         if s>max then begin
         max:=s;a:=i;b:=p-1;end;s:=0;
          until p=n;end;

        write(g,a,' '); write(g,b,' '); write(g,max); close(f);close(g);
        end.