#include <deque>
#include <vector>
#include <cstdio>
#include <fstream>
#define pf push_front
#define pb push_back
#define popb pop_back
#define popf pop_front
#define INFI 2100000000
#define maxn 50002
using namespace std;

deque<int> d;
int k, n, smax=-INFI;
int v[maxn], S[maxn];

int main()
{
    int i, st=0, dr;
    ifstream fin("secv2.in");
    ofstream fout("secv2.out");
    fin>>n>>k;
    for(i=1;i<=n;i++)
        fin>>v[i];
    for(i=1;i<=n;i++)
    {
        S[i]=S[i-1]+v[i];
        if(i>k && S[i-k]<S[st])
            st=i-k+1;
        if(i>=k)
            if(S[i]-S[st]>smax)
                smax=S[i]-S[st], dr=i;
    }
    fout<<st+1<<" "<<dr<<" "<<S[dr]-S[st];
    return 0;
}