#include <iostream>
#include <fstream>
#include <iostream>
#include <fstream>
#include <string>
#include <cmath>
using namespace std;

ifstream f("secv2.in");
ofstream g("secv2.out");

long long int n,k,v[50005],sum[50005],minim=50000*25000,sol=-50000*25000,ind1=0,ind2=0,fost=0;

int main()
{
f>>n>>k;
for(int i=1;i<=n;i++)
 {
  f>>v[i];
  sum[i]=sum[i-1]+v[i];
 }
for(int i=k;i<=n;i++)
 {
  if(sum[i-k]<minim) {minim=sum[i-k]; fost=i-k+1;}
  if(sum[i]-minim>sol)
   {
    ind1=fost; ind2=i;
    sol=sum[i]-minim;
   }
 }
g<<ind1<<" "<<ind2<<" "<<sol;
}