#include <bits/stdc++.h>
using namespace std;
const long long MOD=1000000007;
int v[50005],s[50005];
int main() {
    freopen("secv2.in","r",stdin);
    freopen("secv2.out","w",stdout);
    int n,k;
    scanf("%d %d",&n,&k);
    for(int i=1;i<=n;++i){
        scanf("%d",&v[i]);
        s[i]=s[i-1]+v[i];
    }
    int best=0,usu=-INT_MAX;
    int st=0,dr=0;
    for(int i=k;i<=n;++i){
        if(s[i-k]<s[best]) best=i-k;
        if(i-best>=dr-st&&s[i]-s[best]>=usu){
            usu=s[i]-s[best];
            st=best+1,dr=i;
        }
    }
    printf("%d %d %d\n",st,dr,usu);
    return 0;
}