#include<iostream>
#include<stdlib.h> /* qsort */
#include <stdio.h> /* printf */
#include <math.h>
#include <queue>
#include <iomanip>
#include <string>
#define NMAX 100000
using namespace std;
int Max(long long a , long long int b)
{
	if (a > b)
		return a;
	else
		return b;
}
 int v[NMAX];
int main()
{
	long long int n, k, v1[NMAX];
	FILE *f = fopen("secventa.in", "r");
	FILE *g = fopen("secventa.out", "w");
	fscanf(f, "%lld %lld", &n, &k);
	for (int i=1; i<=n; i++)
	{
		fscanf(f, "%d", &v[i]);
		v1[i] = v[i]; 
	}
	for (int i=2; i<=n; i++)
		v[i] += v[i-1];
	int SMax = v[k];
	int poz;
	for (int i=2; i<=n-k+1; i++)
	{
		if (SMax < (v[k+i-1] - v[i-1]))
		{
			SMax = v[k+i-1] - v[i-1];
			poz = i;
		}
	}
	fprintf(g, "%d %d ", poz, poz+k-1);
	int minim = v1[poz];
	for (int i=poz; i<=poz+k-1; i++)
	{
		if (minim > v1[i])
			minim = v1[i];
	}
	fprintf(g, "%d", minim);
	fclose(f);
	fclose(g);
	return 0;
}