#include <fstream>
#include <iostream>
#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 = -1e9, sol;
short v[N];

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