#include <fstream>
#import <algorithm>
#import <vector>
#import <set>
#import <deque>
using namespace std;
#pragma GCC Optimize("Ofast")

#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;
	}
};
main()
{
    InParser cin("secventa.in");
    ofstream cout("secventa.out");
    int n,k;
    cin>>n>>k;
    deque<int>d;
    int rez=-2e9,dr=-1;
    vector<int>a(n+1,0);
    for(int i=1;i<=n;i++)cin>>a[i];
    for(int i=1;i<=n;i++)
    {
        if(!d.empty() && d.front()==i-k)
        {
            d.pop_front();
        }
        while(!d.empty() && a[d.back()]>=a[i])
        {
            d.pop_back();
        }
        d.push_back(i);
        if(a[d.front()]>rez && i>=k)
        {
            rez=a[d.front()];
            dr=i;
        }
    }
    cout<<dr-k+1<<' '<<dr<<' '<<rez<<'\n';
}