#include <iostream>
#include <fstream>
#include <vector>
#include <deque>
#include <stdio.h>
#include <ctype.h>

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;
	}
};

using namespace std;

int n,k,x,ma=-30005,l,r;
deque < int > dq;
vector < int > v;

int main()
{
    InParser fin("secventa.in");
    ofstream fout("secventa.out");
    fin >> n >> k;
    v.push_back(0);
    for(int i=1;i<=n;i++)
    {
        fin >> x;
        v.push_back(x);
        while(!dq.empty() && v[dq.back()]>x)
            dq.pop_back();
        dq.push_back(i);
        if(dq.front()==i-k)
            dq.pop_front();
        if(i>=k && v[dq.front()]>ma)
        {
            ma=v[dq.front()];
            l=i-k+1;
            r=i;
        }
    }
    fout << l << " " << r << " " << ma;
    return 0;
}