#include<iostream>
#include<fstream>
#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 g("secventa.out");
int n,k;
int v[500005];
deque<int> q;
void Citire()
{
    fin>>n>>k;
    for(int i=1;i<=n;i++)
        fin>>v[i];
}
void Solve()
{
    int min1=v[1];
    int rasp_st=1;
    int rasp_dr=k;
    for(int i=1;i<=n;i++)
    {
        while(!q.empty() && v[q.back()]>=v[i])
            q.pop_back();
        q.push_back(i); 
        //cout<<q.front()<<" "<<q.back()<<" "<<" "<<min1<<"\n";
        if(!q.empty() && q.back()-q.front()==k)
        {
            q.pop_front();
        }
        if(!q.empty())
            if(i>=k)
                if(v[q.front()]>min1)
                {
                    rasp_dr=i;
                    rasp_st=i-k+1;
                    min1=v[q.front()];
                }
                
    }
    g<<rasp_st<<" "<<rasp_dr<<" "<<min1;
}
int main()
{
    Citire();
    Solve();
}