#include <fstream>
#include <climits>
#define dim 50001
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");

long n,k,i,J,I,sum[dim],minim[dim],best[dim],x,bestsum=LONG_MIN;
int main(){

    f>>n>>k;
    for(i=1;i<=n;i++){
        f>>x;
        sum[i]=sum[i-1]+x;

        if(sum[minim[i-1]]<sum[i]) minim[i]=minim[i-1];
            else minim[i]=i;

        best[i]=sum[i]-sum[minim[i-k]];
        if(bestsum<best[i] && i>=k) bestsum=best[i],J=i,I=minim[i-k]+1;
    }

    g<<I<<" "<<J<<" "<<bestsum;
    }