#include <bits/stdc++.h>
#define NMAX 50005
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
deque< int > deq;
int n,k,ct,p,u;
int s[NMAX];
int main()
{
    fin>>n>>k;
    for(int i=1;i<=n;++i)
    {
        int x;
        fin>>x;
        s[i]=s[i-1]+x;

    }
    int i=1,j=n;
    int mx=INT_MIN;
    while(i+k-2<=j)
    {
        int sum=s[j]-s[i-1];
        if(sum>mx)
        {
            mx=sum;
            p=i;
            u=j;
        }
        if(s[i]-s[i-1]>s[j]-s[j-1])--j;
        else ++i;
    }
    fout<<p<<" "<<u<<" "<<mx;
    return 0;
}