#include <fstream>
#define MaxN 50001
using namespace std;

ifstream f("secv2.in");
ofstream g("secv2.out");
int N, K, a[MaxN], x;

int main()
{
    f>>N>>K;
    for (int i=1;i<=N;a[i]=x+a[i-1], i++)
        f>>x;
    int min_i = 0, min_e, min_v, max_s, e = 0, v = K;
    max_s = a[v] - a[e];
    min_e = e;
    min_v = v;
    e++;
    v++;
    while (v<=N)
    {
        if (a[e]<a[min_i])
            min_i = e;
        if (a[v] - a[min_i] >max_s)
        {
            max_s = a[v] - a[min_i];
            min_e = min_i;
            min_v = v;
        }
        e++;
        v++;
    }
    g<<min_e+1<<' '<<min_v<<' '<<max_s;

}