#include <iostream>
#include <fstream>

using namespace std;
ifstream in("secv2.in");
ofstream out("secv2.out");
int sp[6000001], v[6000001];
int main()
{
    int n, i, j, minim=(1ll << 31) - 1, ind, ii, s, st, dr, k;
    int smax=-(1ll << 31)+1;
    in>>n;
    in>>k;
    for(i=1; i<=n; i++)
    {
        in>>v[i];
        if (i==0)
            sp[i]=v[i];
        else sp[i]=sp[i-1]+v[i];
    }
    minim = 0;
    ind = 0;
    for(j=1; j<=n; j++)
    {


        ii=ind;
        s=sp[j]-sp[ii];
        if(s>smax && j>=k)
        {
            smax=s;
            st=ii+1;
            dr=j;
        }
         if(j-k >= 0 && minim>sp[j-k])
        {
            minim=sp[j-k];
            ind = j-k;
        }
    }
    out<<st<<" "<<dr<<" "<<smax;

    return 0;
}