#include <fstream>
#include <deque>
using namespace std;

ifstream fin ("secventa.in");
ofstream fout ("secventa.out");

const int N = 5e5 + 5;

deque <int> d;
int n, k, MAX = -32001, sol, v[N];

char P[1 << 18], *now;

void parse () {
	if (!(*now)) {
		fin.get (P, (1 << 18) - 1, '\0');
		now = P;
	}
}

int get () {
	int sol = 0, sign = 1;
	while ((*now < '0' || *now > '9') && *now != '-') {
		now++;
		parse();
	}
	if (*now == '-')
		sign = -1, now++;
	while (*now >= '0' && *now <= '9') {
		sol = sol * 10 + *now - '0';
		now++;
		parse();
	}
	return sol * sign;
}

int main() {
	now = P;
	parse();
	n = get();
	k = get();
	for (int i = 1; i <= n; ++i) {
		v[i] = get();
		if (d.front() + k == i)
			d.pop_front();
		while (d.size() && v[i] < v[d.back()])
			d.pop_back();
		d.push_back (i);
		if (k <= i && MAX < v[d.front()]) {
			MAX = v[d.front()];
			sol = i;
		}
	}
	fout << sol - k + 1 << " " << sol << " " << MAX;
}