#include<algorithm>
using namespace std;
int n,k;
void solve(){
	int i,nr,poz,st,lg=1,s=-25001,max=-500001;
    scanf("%d%d",&n,&k);
    for(i=1; i<=n; ++i){
        scanf("%d",&nr);
        if(s<0&&i+k<n+2){
            s=nr;
            st=i;}
        else{
            s+=nr;
            if(s>max&&i-st+1>=k){
                max=s;
                poz=st;
                lg=i-st+1;}}}
	printf("%d %d %d",poz,poz+lg-1,max);}
int main(){
    freopen("secv2.in","r",stdin);
    freopen("secv2.out","w",stdout);
    solve();
    return 0;}