#include <bits/stdc++.h>

using namespace std;


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> Q;
int n, k, v[500005], maxim = INT_MIN, st, dr;

int main() {
    fin >> n >> k;
    for(int i = 1; i <= n; i++) {
        fin >> v[i];
    }
    for(int i = 1; i <= n; i++) {
        while(!Q.empty() && Q.front() <= i - k) {
            Q.pop_front();
        }
        while(!Q.empty() && v[i] <= v[Q.back()]) {
            Q.pop_back();
        }
        Q.push_back(i);
        if(i >= k) {
            if(v[Q.front()] > maxim) {
                maxim = v[Q.front()];
                st = Q.front();
                dr = Q.front() + k - 1;
            }
        }
    }
    if(v[Q.front()] > maxim) {
        maxim = v[Q.front()];
        st = Q.front();
        dr = Q.front() + k - 1;
    }
    fout << st << " " << dr << " " << maxim;
    return 0;
}