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

#include <stdio.h>
#include <ctype.h>

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;
	}
};

InParser fin("secventa.in");
ofstream fout("secventa.out");
deque <int> dq;
int n, k, baza_max = -30001, inceput, sfarsit, v[500005];

int main() {
    fin >> n >> k;
    for (int i = 1; i <= n; ++i) {
        fin >> v[i];
        if (!dq.empty()) {
            if (i >= k) {
                if (dq.front() < i - k + 1)
                    dq.pop_front();
                if (v[dq.front()] > baza_max) {
                    baza_max = v[dq.front()];
                    inceput = i - k + 1;
                    sfarsit = i;
                }
            }
            while (v[dq.back()] > v[i]) {
                dq.pop_back();
                if (dq.empty())
                    break;
            }
        }
        dq.push_back(i);
    }
    fout << inceput << " " << sfarsit << " " << baza_max;
    return 0;
}