#include <stdio.h>
using namespace std;

int a[8001][8001], v[50001];
int n, i, j, k, K;
int Max = - 10000000, p1, p2;

int main ()
{
    FILE *f = fopen ("secv2.in","r");
    FILE *g = fopen ("secv2.out","w");
    fscanf (f,"%d %d", &n, &K);
    for (i=1; i<=n; ++i)
        fscanf (f,"%d", &v[i]);

    for (i=1; i<=n; ++i)
    {
        k = i;
        for (j=1; j<=n-i+1; ++j)
        {
            a[i][j] = a[i][j-1] + v[k];
            if (j >= K)
            {
                if (Max < a[i][j])
                {
                     Max = a[i][j];
                    p1 = i;
                    p2 = i + j - 1;
                }
            }
            k ++;
        }
    }

    /*for (i=1; i<=n; ++i)
    {
        for (j=1; j<=n-i+1; ++j)
            printf ("%d ", a[i][j]);
        printf ("\n");
    }

    printf ("Max = %d\np1 = %d\np2 = %d\n", Max, p1, p2);*/

    fprintf (g,"%d %d %d", p1, p2, Max);

    fclose(g);
    fclose(f);
    return 0;
}