#include <bits/stdc++.h>

using namespace std;

ofstream fout("secventa.out");

int n, k, x, maxim = -30007, xx, y;
deque <pair <int, int> > coada;


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()
{
    InParser fin("secventa.in");
    fin >> n >> k;
    for (int i = 1; i <= n; ++i)
    {
        fin >> x;
        while (coada.size() > 0 && x <= coada.back().second)
            coada.pop_back();
        coada.push_back({i, x});
        if (coada.front().first == i - k)
            coada.pop_front();
        if (i >= k)
            if (coada.front().second > maxim)
            {
                maxim = coada.front().second;
                xx = i - k + 1;
                y = i;
            }
    }
    fout << xx << " " << y << " " << maxim;
    fout.close();
    return 0;
}