#include <iostream>
#include <fstream>

using namespace std;

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

int v[50001], sum[50001], k, n, pc=1, pmax, umax;
long long smax = - 2000000000, sc = 0;

int main()
{
    fin >> n >> k;
    for ( int i = 1; i <= n; i++)
    {
        fin >> v[i];
        sum[i] = sum[i - 1] + v[i];
        if (i >= k && sum[i] - sum[i - k] > sc + v[i])
        {
            sc = sum[i] - sum [i - k];
            pc = i - k + 1;
        }else{
            sc += v[i];
        }
        if ( i >= k && sc > smax)
        {
            smax = sc;
            pmax = pc;
            umax = i;
        }
    }
    fout << pmax << " " << umax << " " << smax;
    return 0;
}