#include <iostream>
#include<deque>
#include<fstream>
using namespace std;
deque <int> d;
int i,n,k,s,bests,a,j,start,stop,q;
int main()
{
 ifstream f("secv2.in");
 ofstream g("secv2.out");
 bests=-99999999999;
 f>>n>>k;j=1;
 for(i=1;i<=n;i++)
 {
     f>>a;
     s+=a;
     d.push_back(s);
     if(d.size()>k && d.front()<0)
        {for(q=1;q<=d.size()-1;q++) d[q]-=d.front();
     s-=d.front();j=i-d.size()+1;}

     if(d.size()>k) d.pop_front();

     if(d.size()==k)if(s>bests) {bests=s;start=j;stop=i;}

 }

 g<<start<<" "<<stop<<" "<<bests;
    return 0;
}