#include <bits/stdc++.h>
#define DM 50001
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");

int n,s[DM],mx[DM],aux,st,dr,k;
int main()
{
    fin>>n>>k;
    for(int i=1;i<=n;++i)
    {
        fin>>aux;
        s[i]=s[i-1]+aux;
    }
    mx[n]=n; ///pastrez in mx indicele care arata cea mai mare suma
    for(int i=n;i>=1;--i)
    {
        if(s[i-1]>s[mx[i]]) mx[i-1]=i-1;
        else mx[i-1]=mx[i];
    }

    int sum=INT_MIN;
    for(int i=1;i<=n-k;++i)
        if(s[mx[i+k]]-s[i]>sum)
            sum=s[mx[i+k]]-s[i],st=i,dr=mx[i+k];

    fout<<st+1<<" "<<dr<<" "<<sum;


    return 0;
}