#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
int n,k,vCit[50005];
vector <pair<int,int> > sol;
void citire()
{
    scanf("%d %d",&n,&k);
    for(int i=1;i<=n;i++)
    {
        scanf("%d",&vCit[i]);
        vCit[i]+=vCit[i-1];
    }
}
int main()
{
    freopen("secv2.in","r",stdin);
    freopen("secv2.out","w",stdout);
    citire();
    int minim=vCit[1],pozMin=1;
    int sumMax=vCit[1+k]-vCit[1],pozMax=1+k;
    for(int i=2;i<=n-k;i++)
    {
        if(sumMax<vCit[i+k]-minim)
        {
            sumMax=vCit[i+k]-minim;
            pozMax=i+k;
        }
        if(minim>vCit[i])
        {
            minim=vCit[i];
            pozMin=i;
        }
    }

    printf("%d %d %d",pozMin+1,pozMax,sumMax);

    return 0;
}