#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <fstream>
#include <stack>
#include <string>
#include <cstring>
#include <queue>
#include <deque>
 
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");
 
int n, a;
int v[510000];
int ans;
int maximum = -1e9;
int pozitie_start;
int pozitie_final;
 
 
 
int main(){
    fin >> n;
    fin >> a;
 
    for (int i = 1; i<=n; i++){
        fin >> v[i];
    }
 
    deque<int> d;
 
    for (int i = 1; i<=n; i++){
        if (!d.empty() and i-d.front() == a){
            d.pop_front();
        }
        while (!d.empty() and v[i] <= v[d.back()]){
            d.pop_back();
        }
        d.push_back(i);
        if (i>=a){
            if (v[d.front()]> maximum){
                maximum = v[d.front()];
                pozitie_final = i;
                pozitie_start = i-a+1;
            }
        }
    }
 
    fout << pozitie_start << " " << pozitie_final << " " << maximum;
}