#include<fstream>
#include<deque>
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;
    }
} in( "secventa.in" );
ofstream out("secventa.out");
int n,i,k,v[500001],maxim,alfa,beta,ok;
deque <int> w;
int main(){
    in >> n >> k;
    for( i = 1; i <= n; i ++ ){
        in >> v[i];
    }
    for( i = 1; i <= n; i ++ ){
         while(  w.empty() == 0 && v[w.back()] > v[i] ){
            w.pop_back();
         }
         w.push_back(i);
         if( w.front()<= i - k ){
            w.pop_front();
         }
        if( ok == 0 && w.back() >= k){
            maxim = v[w.front()];
            alfa = i - k + 1;
            beta = i;
            ok =1;
        }
         if( v[w.front()] > maxim && w.back() >= k){
            maxim = v[w.front()];
            alfa = i - k + 1;
            beta = i;
         }
    }
    out << alfa <<" "<< beta << " " << maxim ;
    return 0;
}