#include <stdio.h>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <stdio.h>
#include <iostream>
#include <algorithm>
using namespace std;

#ifdef _WIN32
#define TYPEOF decltype
#else
#define TYPEOF typeof
#endif

#define FOR(i,s,e) for(int i = s;i < e; i++)
#define TR(i, c) for(TYPEOF(c.begin()) i = c.begin(); i != c.end(); ++i)
#define TRS(i, c, ...) TR(__itr, c) { TYPEOF(*c.begin()) &i = *__itr;  __VA_ARGS__ }
#define TRP(f, s, c, ...) TR(__itr, c) { TYPEOF(c.begin()->first) &f = __itr->first; TYPEOF(c.begin()->second) &s = __itr->second;  __VA_ARGS__ }

int a[500001];
int v[500001];

int main()
{
#if 1
	freopen("secventa.in", "r", stdin);
	freopen("secventa.out", "w", stdout);
#endif

	int n,k;

	scanf("%d %d", &n, &k);

	int s = 0, e = -1, best = -40000, best_i;

	a[0] = 0;
	scanf("%d", &v[0]);

	FOR(i,1,n) {
		int c;
		scanf("%d", &c);
		
		if(a[s] == i - k) {
			s++;
		}

		while(e >= s) {
			if(v[e] >= c)
				e--;
			else
				break;
		}
		++e;
		a[e] = i;
		v[e] = c;

		if(i >= k-1 && v[s] > best) {
			best = v[s];
			best_i = i;
		}
	}

	printf("%d %d %d\n", best_i+1 -k+1, best_i+1, best);

	return 0;
}