#include <bits/stdc++.h>
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
int n,k,i,x,S[50010],D[50010],st[50010],p,nr,p1,p2,u,sol=INT_MIN;
int main(){
    fin>>n>>k;
    for(i=1;i<=n;i++)
        fin>>x,S[i]=S[i-1]+x;
    D[1]=1;
    p=u=1;
    for(i=2;i<=n;i++){
        while(p<=u&&S[i]<S[D[u]])
            u--;
        D[++u]=i;
        if(i-D[p]==k){
            while(nr&&S[D[p]]<S[st[nr]])
                nr--;
            st[++nr]=D[p];
            p++;
        }
        if(i>=k)
            if(sol<S[i]){
                sol=S[i];
                p1=i;
                p2=1;
            }
            if(i-st[1]>=k){
                if(sol<S[i]-S[st[1]]){
                    sol=S[i]-S[st[1]];
                    p1=i;
                    p2=st[1]+1;
                }
            }
    }
    fout<<p2<<" "<<p1<<" "<<sol;

    return 0;
}