#include <cstdio>
#include <deque>

using namespace std;

const int INF=1e9;

deque<int> q;
int v[50010];

int main()
{
    freopen("secv2.in","r",stdin);
    freopen("secv2.out","w",stdout);
    int n,k,sol=-INF,a,b;
    scanf("%d%d",&n,&k);
    for(int i=1;i<=n;i++)
    {
        scanf("%d",&v[i]);
        v[i]+=v[i-1];
    }
    for(int i=0;i<=n;i++)
    {
        while(!q.empty() && v[i]<=v[q.back()]) q.pop_back();
        q.push_back(i);
        if(i+k<=n) if(v[i+k]-v[q.front()]>sol) {sol=v[i+k]-v[q.front()];a=q.front()+1;b=i+k;}
    }
    printf("%d %d %d",a,b,sol);
    return 0;
}