#include<iostream>
#include<fstream>
#include<deque>
#include<vector>
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");
struct coord
{
    int x,y,val;
};
int n,k;
int v[500005];
vector<coord> minime;
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 st=1;
    int dr=0;
    for(int i=1;i<=n;i++)
    {
        if(!q.empty())
            dr=q.back();
        while(!q.empty() && v[q.back()]>v[i])
            q.pop_back();
        q.push_back(i); 
        if(q.back()-q.front()>=k)
        {
            q.pop_front();
        }
       if(!q.empty())
            if(i>=k)
                if(v[q.front()]!=min1)
                {
                    coord numar;
                    numar.x=dr-k+1;
                    numar.y=dr;
                    numar.val=min1;
                    minime.push_back(numar);
                    min1=v[q.front()];
                    if(i==n)
                    {
                        numar.x=n-k+1;
                        numar.y=n;
                        numar.val=min1;
                        minime.push_back(numar);
                    }
                }
                
    }
    min1=-30001;
    st=0;
    dr=0;
    for(int i=0;i<minime.size();i++)
    {
        //cout<<minime[i].val<<" "<<minime[i].x<<" "<<minime[i].y<<"\n";
        if(minime[i].val>min1)
        {
            min1=minime[i].val;
            st=minime[i].x;
            dr=minime[i].y;
        }
    }
    g<<st<<" "<<dr<<" "<<min1;
}
int main()
{
    Citire();
    Solve();
}