#include<fstream.h>
#define g 5005
//using namespace std;
long a[g],b[g];
int main()
 {
  ifstream be ("secv2.in");
  ofstream ki ("secv2.out");
  long i,x,y,j,max=-1250000000,n,k;
  be>>n>>k;
  be>>a[1];
  b[1]=a[1];
  for (i=2;i<=n;i++)
    {
     be>>a[i];
       b[i]=b[i-1]+a[i];
    }
  be.close();
  for (i=1;i<=n-k+1;i++)
     for (j=i+k-1;j<=n;j++)
	if (b[j]-b[i-1]>max)
	  {
	   max=b[j]-b[i-1];
	   x=i;
	   y=j;
	  }
  ki<<x<<" "<<y<<" "<<max<<'\n';
  ki.close();
  return 0;
 }