#include <fstream>

//100 puncte
//algoritmul lui Kadane implementat fara vector
using namespace std;

int n,k;

ifstream fin ("secv2.in");
ofstream fout ("secv2.out");

int main()
{
    fin>>n>>k;
    long long int sMax=-25001,s_part=0;
    int stMax=0,drMax=0;
    int st=1;
    for(int i=1; i<=n; i++)
    {
        int x;
        fin>>x;
        s_part+=x;
        //fout<<s_part<<endl;
        if(s_part>sMax && i-st+1>=k)
        {
            sMax=s_part;
            stMax=st;
            drMax=i;
        }
        if(s_part<0)
        {
            s_part=0;
            st=i+1;
        }
    }
    fout<<stMax<<" "<<drMax<<" "<<sMax;
    return 0;
}