#include <fstream>
#include <cmath>
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
int N,K,v[10000],s[10000],prim,ultim;
long long maxim=-10000,minim1=0;

int main()
{
    fin>>N>>K;
    for(int i=1;i<=N;i++)
    {
        fin>>v[i];
        s[i]=s[i-1]+v[i];
    }
    int prim1=0;
    for(int i=K;i<=N;i++)
    {
        if(s[i]-s[prim1]>maxim)
        {
            maxim=s[i]-s[prim1];
            prim=prim1+1;
            ultim=i;
        }
        if(s[i-K+1]<minim1)
        {
            minim1=s[i-K+1];
            prim1=i-K+1;
        }
    }
    fout<<prim<<" "<<ultim<<" "<<maxim<<"\n";
    return 0;
}