#include <iostream>
#include <fstream>
#include <deque>
#include <vector>
using namespace std;

#define nmax 50005
#define ma 1250000001
ifstream in("secv2.in");
ofstream out("secv2.out");

long long n,k,i,lo=1,hi,maxim=-ma,MAX=-ma,S=0,x,ind;
long long s[nmax];

int main(){
    
    in >> n >> k;
    
    for (i=1; i<=n; i++){
        in >> x;
        s[i]=s[i-1]+x;
    }
    
    for (i=n-k+1; i>0; i--){
        if (s[i+k-1]>maxim){
            ind=i+k-1;
            maxim=s[i+k-1];
        }
        S=maxim-s[i-1];
        if (S>MAX){
            lo=i;
            hi=ind;
            MAX=S;
        }
    }
    
    out << lo << " " << hi << " " << MAX << "\n";
    
    return 0;
}