#include <iostream>
#include <fstream>
#define NMAX 500005
#define MINF -390000

using namespace std;

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

int a[NMAX],sum[NMAX],n,k,minim,maxim,start,finish;

int main()
{
    in >> n >> k;

    for(int i=1;i<=n;i++) {
        in >> a[i];
        sum[i] = sum[i-1]+ a[i];
    }
    maxim = MINF;
    for(int i=1;i<=n-k+1;i++) {
        for(int j=i+k-1;j<=n;j++) {
            minim = a[i];
            for(int k=i+1;k<=j;k++){
                minim = min(minim,a[i]);

            }
             if(maxim < minim) {
                maxim = minim;
                start = i;
                finish = j;
             }
        }
    }

    out << start << " " << finish << " " << maxim;

    return 0;
}