#include <iostream>
#include <fstream>
#include <deque>

using namespace std;

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

deque <int> d;
int x,n,k,i,s,l,mx,i0,i1;

int main()
{
    f>>n>>k;
    mx=-2000000000;
    for(i=1; i<=n; ++i)
    {
        f>>x;
        s+=x;
        d.push_back(x);
        if(d.size()>=k)
        {
            if(s>mx)
            {
                mx=s;
                i0=i-d.size()+1;
                i1=i;
            }
            while(d.size()>k && (s<0 || d[0]<0))
            {
                s-=d[0];
                d.pop_front();
            }
        }
    }
    cout<<i0<<' '<<i1<<' '<<mx;
}