#include <fstream>
#include <deque>
#include <iostream>
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;
	}
};
ofstream fout("secventa.out");
int A[500010];
deque<pair<int,int>> Deque;
int n,k,maxim = -2000000000,start,val;
int main()
{
    InParser fin("secventa.in");
    fin>>n>>k;
    for(int i = 1; i<=n; i++)
        fin>>A[i];
    for(int i = 1; i<=n; i++)
    {
        val = A[i];
        while(Deque.size() && Deque.back().first >= val)
            Deque.pop_back();
        Deque.push_back({val,i});
        if(Deque.front().second==i-k)
            Deque.pop_front();
        if(i>=k)
        {
            if(Deque.front().first>maxim)
            {
                maxim = Deque.front().first;
                start = i;
            }
        }
    }
    fout<<start-k+1<<' '<<start<<' '<<maxim;
    return 0;
}