#include <fstream>
#include <climits>

#define NM 50001

using namespace std;

ifstream InF ("secv2.in");
ofstream OutF ("secv2.out");

int a[NM];
unsigned n, k;

int sum[NM];
int Max = INT_MIN;
int L_Lim, R_Lim;
unsigned i, j;

void Scan ();
void Solve ();
void Print ();

int main()
{
    Scan ();
    Solve ();
    Print ();
    return 0;
}

void Scan ()
{
    InF >> n >> k;
    for (i=0; i<n; i++)
        InF >> a[i];
}

void Solve ()
{
    for (i=0; i<n; i++)
        sum[i] = sum[i-1] + a[i];
    for (i=0; i<n; i++)
        for (j=i+k-1; j<n; j++)
            if (sum[j]-sum[i-1] > Max)
            {
                Max = sum[j] - sum[i-1];
                L_Lim = i+1;
                R_Lim = j+1;
            }
}

void Print ()
{
    if (n == k)
        OutF << L_Lim << " " << L_Lim << " " << 1;
    else
        OutF << L_Lim << " " << R_Lim << " " << Max;
}