#include <bits/stdc++.h>
using namespace std;

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

long long bestsum=-1250000000,pr=1,ul=1,indx,s=0,st=0,nr,n,k;
int main()
{
    in>>n>>k;
    for(int i=1;i<=n;i++){
        in>>nr;
        if(s<0){
            indx=i;
            s=0;
        }
        s+=nr;
        st+=nr;
        if(i-indx+1>=k && bestsum<s)
        {
            pr=indx;
            ul=i;
            bestsum=s;
        }
    }
    if(n==k)out<<1<<' '<<n<<' '<<st;
    else out<<pr<<' '<<ul<<' '<<bestsum;
    return 0;
}