#include<fstream>
#include<deque>
using namespace std;
deque<int> q;
int n, k, i, s, sol, x[50002], p1, p2, ok;
ifstream in("secv2.in");
ofstream out("secv2.out");
int main()
{
    in>>n>>k;
    ok=0;
    sol=-2000000000;
    for(i=1; i<=n; i++)
    {
        in>>x[i];
        s+=x[i];
        q.push_back(i);
        if(q.size()==k)
        {
            if(s>sol)
            {
                sol=s;
                p1=q.front();
                p2=q.back();
            }
            s-=x[q.front()];
            q.pop_front();
        }
        if(x[i]>0)
            ok=1;
    }
    if(ok==0)
    {
        out<<p1<<" "<<p2<<" "<<sol;
        return 0;
    }
    sol=-2000000000;
    i=1;
    while(i<=n)
    {
        q.push_back(i);
        s+=x[i];
        if(s<0)
        {
            s=0;
            while(!q.empty())
                q.pop_back();
        }
        if(q.size()>=k)
        {
            if(s>sol)
            {
                sol=s;
                p1=q.front();
                p2=q.back();
            }
        }
        i++;
    }
    out<<p1<<" "<<p2<<" "<<sol;
    return 0;
}