#include <fstream>
#include <deque>
#define nmax 50005
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
int n,k,sol=-1<<30,p,u;
int v[nmax],s[nmax];
deque <int> d;

int main()
{
    int i,j;
    f>>n>>k;
    for (i=1;i<=n;i++) {
        f>>v[i];
        s[i]=s[i-1]+v[i];
    }
    for (i=k;i<=n;i++) {
        while (!d.empty()&&s[d.back()]>s[i-k])
                d.pop_back();
        d.push_back(i-k);

        if (s[i]-s[d.front()]>sol) {
                p=d.front()+1;
                u=i;
                sol=s[i]-s[d.front()];
        }
    }
    g<<p<<' '<<u<<' '<<sol<<'\n';

    return 0;
}