#include <bits/stdc++.h>
using namespace std;

#define problem "secventa"
#define NMAX 500005

class InParser {
private:
	FILE *fin;
	char *buff;
	int sp;

	char read_ch() {
		++sp;
		if (sp == 4096) {
			sp = 0;
			fread(buff, 1, 4096, fin);
		}
		return buff[sp];
	}

public:
	InParser(const char* nume) {
		fin = fopen(nume, "r");
		buff = new char[4096]();
		sp = 4095;
	}

	InParser& operator >> (int &n) {
		char c;
		while (!isdigit(c = read_ch()) && c != '-');
		int sgn = 1;
		if (c == '-') {
			n = 0;
			sgn = -1;
		} else
			n = c - '0';
		while (isdigit(c = read_ch()))
			n = 10 * n + c - '0';
		n *= sgn;
		return *this;
	}

	InParser& operator >> (long long &n) {
		char c;
		n = 0;
		while (!isdigit(c = read_ch()) && c != '-');
		long long sgn = 1;
		if (c == '-') {
			n = 0;
			sgn = -1;
		} else
			n = c - '0';
		while (isdigit(c = read_ch()))
			n = 10 * n + c - '0';
		n *= sgn;
		return *this;
	}
};

int v[NMAX];

int main()
{
	InParser fin(problem ".in");
	freopen(problem ".out", "w", stdout);

	int n, k;
	fin >> n >> k;

	for (int i = 1; i <= n; ++i)
		fin >> v[i];

	int ans = INT_MIN, end;
	deque<int> dq;

	for (int i = 1; i <= n; ++i) {
		while (!dq.empty() && v[dq.back()] >= v[i])
			dq.pop_back();
		while (!dq.empty() && dq.front() <= i - k)
			dq.pop_front();
		dq.push_back(i);
		if (i >= k && v[dq.front()] > ans) {
			ans = v[dq.front()];
			end = i;
		}
	}

	printf("%d %d %d\n", end - k + 1, end, ans);
}