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

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

char buffer[4000000], *p = buffer;
int N, K, mx = -1000000069, sol;
deque<pair<int, int>> dq;

int main() {
	fin >> N >> K;
	fin.ignore(1);
	fin.getline(buffer, 4000000);
	for (int i = 1; i <= N; ++i) {
		int x = 0;
		bool negativ = false;
		while (*p == ' ')
			++p;
		if (*p == '-') {
			++p;
			negativ = true;
		}
		while (isdigit(*p))
			x = x * 10 + *(p++) - '0';
		if (negativ)
			x *= -1;
		while (!dq.empty() && dq.front().first <= i - K)
			dq.pop_front();
		while (!dq.empty() && x < dq.back().second)
			dq.pop_back();
		dq.push_back(make_pair(i, x));
		if (i >= K && dq.front().second > mx) {
			sol = i;
			mx = dq.front().second;
		}
	}
	fout << sol - K + 1 << " " << sol<< " " << mx << "\n";
	return 0;
}