#include<algorithm>
using namespace std;
int n,k,a[50001];
void solve(){
    int i,j,st,dr,max=-25000;
    scanf("%d%d",&n,&k);
    for(i=1; i<=n; ++i){
        scanf("%d",&a[i]);
        a[i]+=a[i-1];}
    for(i=0; i+k<n+2; ++i)
        for(j=i+k; j<=n; ++j)
            if(a[j]-a[i]>=max){
                max=a[j]-a[i];
                st=i;
                dr=j;}
    printf("%d %d %d",st,dr,max);}
int main(){
    freopen("secv2.in","r",stdin);
    freopen("secv2.out","w",stdout);
    solve();
    return 0;}