#include <iostream>
#include <deque>
#include <climits>

#define MAXN 500002

using namespace std;
int N, K, A[MAXN], best = -INT_MAX, spos = 0, epos = 0;
deque<int> q;


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;
    }
};

int main()
{
    InParser fin("secventa.in");
    FILE *out = fopen("secventa.out", "w");
    fin >> N >> K;
    for(int i = 1; i <= N; i++) {
        fin >> A[i];
    }

    for(int i = 1; i <= N; i++) {
        while(!q.empty() && A[q.back()] > A[i])
            q.pop_back();

        if(!q.empty() && q.front() <= i - K)
            q.pop_front();

        q.push_back(i);

        if(i >= K) {
            int pre_best = max(A[q.front()], best);
            if(best != pre_best) {
                best = pre_best;
                spos = i - K + 1;
                epos = i;
            }
        }

    }
    fprintf(out, "%d %d %d", spos, epos, best);


    return 0;
}