#include <fstream>

using namespace std;

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

int n,k,v[50001],p1,p2;
long long s;

void citire(){
    f>>n>>k;
    for (int i=1;i<=n;i++)
        f>>v[i];
    f.close();
    return;}

int sum(int p1, int p2){
    long long s=0;
    for (int i=p1;i<=p2;i++)
        s+=v[i];
    return s;}

void solve(){
    int max=-25002,pt1,pt2;
    for (int c=k;c<=n/2;c++)
        for (int i=1;i<=n-c+1;i++)
        if (sum(i,i+c-1)>max){
            pt1=i;
            pt2=i+c-1;
            max=sum(i,i+c-1);}
    g<<pt1<<" "<<pt2<<" "<<max;
    g.close();
    return;}


int main()
{
    citire();
    solve();
    return 0;
}