#include <iostream>
#include <fstream>
#include <deque>
using namespace std;
int s[50001];
deque<int> coada;
int main()
{
    ifstream in("secv2.in");
    ofstream out("secv2.out");
    int i,n,k,sumamax=-2000000000,minim=2000000000,x,y,loc;
    in>>n;
    in>>k;
    for (i=1;i<=n;i++)
    {
        in>>s[i];
        s[i]+=s[i-1];
    }
    minim=s[1];
    loc=1;
    sumamax=s[k];
    for (i=k+1;i<=n;i++)
    {
        if (s[i-k]<minim)
        {
            minim=s[i-k];
            loc=i-k;
        }
        if (s[i]-minim>sumamax)
        {
            sumamax=s[i]-minim;
            x=loc+1;
            y=i;
        }
    }
    out<<x<<" "<<y<<" "<<sumamax;
}