#include <iostream>
#include <fstream>
#include <deque>
using namespace std;
int n,k,a[500005],maxim,poz,i;
deque <int> dq;

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 f("secventa.in");
    ofstream g("secventa.out");
    f>>n;
    f>>k;
    for(i=1;i<=n;i++)
    {
        f>>a[i];
    }
    maxim=-30001;
    for(i=1;i<=n;i++)
    {
        while(!dq.empty() && a[i]<=a[dq.back()])
        {
            dq.pop_back();
        }
        dq.push_back(i);
        while(dq.front()<=i-k)
        {
            dq.pop_front();
        }
        if(i>=k)
        {
            if(a[dq.front()]>maxim)
            {
                maxim=a[dq.front()];
                poz=i;
            }
        }
    }
    g<<poz-k+1<<" "<<poz<<" "<<maxim;
    return 0;
}