#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("secv2.in");
ofstream fout ("secv2.out");
struct cell{int x,y;};
cell v[500001],z;
bool pred (cell a,cell b)
{
    if(a.x<b.x)
        return true;
    else
        if(a.x>b.x)
            return false;
        else
            if(a.y<b.y)
                return true;
            else
                return false;


};
int maxi,sf,in,k,pmini,s,j,poz,r,ls,ld,mij,i,n,a;
int main ()
{
    fin>>n;
    fin>>k;
    fin>>v[1].x;
    v[1].y=1;
    for(i=2;i<=n;i++)
    {
        fin>>a;
        v[i].y=i;
        v[i].x=a+v[i-1].x;
        if(i>=k)
        {
            sort(v+1,v+(i-k+1),pred);
            if(v[i].x-v[1].x>maxi)
            {
                maxi=v[i].x-v[1].x;
                in=v[1].y;
                sf=v[i].y;
            }
        }

    }

fout<<in<<" "<<sf<<" "<<maxi;
fout.close();
fin.close();
return 0;
}