#include <iostream>
#include <fstream>
#include <deque>

#define ll long long
#define ull unsigned long long
#define pb push_back
using namespace std;
//ifstream in("secventa.in");
ofstream out("secventa.out");

const int NMax = 5e5 + 5;

int N,K;
int v[NMax];
deque<int> deq;

class parser {
    using integer = int;
    static const int strMax = 35e5 + 5;

    ifstream in;
    char str[strMax],*p;
    bool failed;

    public:
    parser(string s) {
        in.open(s);
        in.get(str,strMax,1);
        //cout<<str<<'\n';
        p = str;
        failed = false;
    }

    parser& operator>> (integer& nr) {
        bool neg = 0;
        while ( !( ('0' <= *p && *p <= '9') || *p == '\0') ) {
            if (*p == '-') {
                neg ^= 1;
            }
            ++p;
        }

        if (*p == '\0') {
            nr = 0;
            failed = true;
            return *this;
        }

        nr = 0;
        while ('0' <= *p && *p <= '9') {
            nr = nr * 10 + *p++ - '0';
        }
        if (neg) {nr = -nr;}

        return *this;
    }

    bool fail() {
        return failed;
    }

    void print() {
        cout<<str<<'\n';
    }

    void close() {
        in.close();
    }
};
parser pin("secventa.in");

int main() {
    pin>>N>>K;

    int mx = -1e5,st = -1,dr = -1;
    for (int i=1;i <= N;++i) {
        pin>>v[i];

        while (deq.size() && v[deq.back()] >= v[i]) {
            deq.pop_back();
        }
        deq.push_back(i);
        if (deq.front() == i-K) {
            deq.pop_front();
        }

        if (i >= K) {
            if (v[deq.front()] > mx) {
                mx = v[deq.front()];
                dr = i;
                st = i-K+1;
            }
        }
    }
    out<<st<<' '<<dr<<' '<<mx<<'\n';

    pin.close();out.close();
    return 0;
}