#include <cstdio>
#include <iostream>
#define MAXN 50005
using namespace std;

class InputParser
{
    char *b;
    int bs, bi;
    bool isdigit(char c){ return c>='0' && c<='9';}
    bool issgn(char c){ return c=='-' || c=='+';}
public:
    InputParser(FILE *f)
    {
        fseek(f,0,SEEK_END);
        bs = ftell(f);
        b = new char[bs+1];
        fseek(f,0,SEEK_SET);
        fread(b,1,bs,f);
        bi = 0;
    }
    InputParser operator>>(int &x)
    {
        x = 0;
        int sgn = 1;
        while(!isdigit(b[bi]) && !issgn(b[bi])) ++bi;

        if(issgn(b[bi]))
        {
            if(b[bi]=='-')
                sgn = -1;
            else sgn=1;
        }

        while(!isdigit(b[bi])) ++bi;

        while(isdigit(b[bi]))
            x = x * 10 + b[bi++] - '0';

        x*=sgn;
        return *this;
    }
    InputParser operator>>(long long &x)
    {
        x = 0;
        long long sgn = 1;
        while(!isdigit(b[bi]) && !issgn(b[bi])) ++bi;

        if(issgn(b[bi]))
        {
            if(b[bi]=='-')
                sgn = -1;
            else sgn=1;
        }

        while(!isdigit(b[bi])) ++bi;

        while(isdigit(b[bi]))
            x = x * 10 + b[bi++] - '0';

        x*=sgn;
        return *this;
    }
};

class OutputParser
{
    char b[1000000];
    int bi, bs;
public:
    OutputParser()
    {
        bi = 0;
    }
    void operator<<(long long x)
    {
        char aux[1000];
        int auxi=999;
        do
        {
            aux[auxi--] = x % 10 + '0';
            x /= 10;
        }while(x);

        for(int i=auxi+1;i<=999;i++)
            b[bi++] = aux[i];
    }
    void operator<<(char c)
    {
        b[bi++] = c;
    }
    void write(FILE *f)
    {
        b[bi++]=0;

        fwrite(b,1,bi,f);
    }
};


int k, n;
long long int s[MAXN], m[MAXN], poz[MAXN], inc, sf, smax = -(1LL<<60);
int main()
{
    InputParser in(fopen("secv2.in","r"));

    in>>n;
    in>>k;
    for(int i=1;i<=n;i++)
    {
        long long a;
        in>>a;
        s[i] = s[i-1] + a;
        if(s[i]>m[i-1])
        {
            m[i] = m[i-1];
            poz[i] = poz[i-1];
        }
        else
        {
            m[i] = s[i];
            poz[i] = i;
        }
    }

    for(int i=k;i<=n;i++)
    {
        if(s[i] - m[i-k] > smax)
        {
            smax = s[i] - m[i-k];
            inc = poz[i-k]+1;
            sf = i;
        }
    }

    OutputParser out;
    out<<inc;
    out<<' ';
    out<<sf;
    out<<' ';
    out<<smax;

    out.write(fopen("secv2.out","w"));
    return 0;
}