#include <fstream>

using namespace std;

int n, i, p, u, k, d[500003], b;
short v[500003], maxim = -30005;

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

int main(){
    fin>>n>>k;
    fin>>v[1];
    p = u = 1;
    d[1] = 1;
    for(i=2;i<=n;i++){
        fin>>v[i];
        while(p <= u && v[i] < v[d[u]])
            u--;
        d[++u] = i;
        if(i - d[p] == k)
            p++;
        if(i >= k && v[d[p]] > maxim){
            maxim = v[d[p]];
            b = i;
        }
    }
    fout<<b-k+1<<" "<<b<<" "<<maxim;
    return 0;
}