#include <stdio.h>
#include <deque>

using namespace std;

#define DIM 5000010

int V[DIM];
int Max = -1000000;
deque<int> D;
int N, K, i, p, u;

int main() {
	FILE *f = fopen("secventa.in","r");
	fscanf(f,"%d %d",&N, &K);
	for (i=1;i<=N;i++) {
		fscanf(f,"%d",&V[i]);
		while (!D.empty() && V[i]<=V[D.back()] )
			D.pop_back();
		D.push_back(i);
		if (i>K && i-D.front() == K)
			D.pop_front();
		if (i>=K && Max<V[D.front()]) {
			Max = V[D.front()];
			u = i;
			p = i-K+1;
		}

	}
	fclose(f);
	FILE *g = fopen("secventa.out","w");
	fprintf(g,"%d %d %d",p,u,Max);
	fclose(g);
	
	return 0;
}