#include <fstream>

using namespace std;

ifstream f("secventa.in");
ofstream g("secventa.out");

int n,k,v[50001],p1,p2;
long long s;

void citire(){
    f>>n>>k;
    for (int i=1;i<=n;i++)
        f>>v[i];
    f.close();
    return;}

int minim(int p1, int p2){
    int min=30002;
    for (int i=p1;i<=p2;i++)
        if (v[i]<min)
            min=v[i];
    return min;}

void solve(){
    int max=-30002,pt1,pt2;
    for (int i=1;i<=n-k+1;i++)
        if (minim(i,i+k-1)>max){
            max=minim(i,i+k-1);
            pt1=i;
            pt2=i+k-1;}
    g<<pt1<<" "<<pt2<<" "<<max;
    g.close();
    return;}

int main()
{
    citire();
    solve();
    return 0;
}