#include <fstream>
#include <deque>

const int MAX_N  = 5 * 1e5;
int a[1 + MAX_N];
std::deque<int> dq;


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 main() {
  std::ifstream fin("secventa.in");
  std::ofstream fout("secventa.out");
  int n, k;
  fin >> n >> k;
  for (int i = 1; i <= n; i++) {
    fin >> a[i];
  }
  int mx = -(1 << 30), st, dr;
  for (int i = 1; i <= n; i++) {
    if (!dq.empty() && dq.front() == i - k) {
      dq.pop_front();
    }
    while (!dq.empty() && a[i] < a[dq.back()]) {
      dq.pop_back();
    }
    dq.push_back(i);
    if (i >= k && a[dq.front()] > mx) {
      mx = a[dq.front()];
      st = i - k + 1;
      dr = i;
    }
  }
  fout << st << " " << dr << " " << mx;
  return 0;
}