#include <fstream>
using namespace std;
ofstream fout ("secventa.out");
ifstream fin ("secventa.in");
int n,k,front,back,i,d[500010];
int v[500010],maxim,inceput;
 
int main () {
 
    fin>>n>>k;
    for (i=1;i<=n;i++)
        fin>>v[i];
 
    front = 1; back = 0; maxim=-30010;
 
    for (i=1;i<=n;i++) {
 
        while (front<=back && v[i] <= v[d[back]]) back --;
 
        d[++back]= i;
 
        if (i - d[front] == k)
            front ++;
 
        if (i>=k)
            if (v[d[front]] > maxim) {
                maxim=v[d[front]];
                inceput=i;
            }
    }
 
 
    fout << inceput-k+1 << " " << inceput << " " << maxim << "\n";
 
    return 0;
}