#include <bits/stdc++.h>
using namespace std;
const int N = 500010;
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 f("secventa.in");
ofstream g("secventa.out");
deque <pair<int, int>> dq;
int n, k, x, st, maxi = -30010;
int main()
{
    f >> n >> k;
    for(int i = 1; i <= n; i++)
    {
        f >> x;
        while(!dq.empty() && dq.back().first >= x)
            dq.pop_back();
        dq.push_back({x, i});
        if(dq.front().second == i - k)
            dq.pop_front();
        if(i >= k && dq.front().first > maxi)
            tie(maxi, st) = dq.front();
    }
    g << st << ' ' << st + k - 1 << ' ' << maxi;
    return 0;
}