/*
Punctaj final pe sursa curenta: 100p
*/
#include <fstream>

using namespace std;

ifstream fin("secv2.in");
ofstream fout("secv2.out");

const int Nmax = 50001;
const int INF = 2000000000;
 
int v[Nmax], s[Nmax];
 
int main()
{
    int i, n, k, smax = -INF, x = 0, y = -1, MIN = INF, pozMin;
    fin >> n >> k;
    for(i = 1; i < k; ++i)
    {
        fin >> v[i]; s[i] = s[i-1] + v[i];
    }
    for(i = k; i <= n; ++i)
    {
        fin >> v[i]; s[i] = s[i-1] + v[i];
        if(MIN > s[i-k]) MIN = s[i-k], pozMin = i - k;
        if(s[i] - MIN > smax) smax = s[i] - MIN, x = pozMin + 1, y = i;
    }
    fout << x << ' ' << y << ' ' << smax << '\n';
    return 0;
}