#include <bits/stdc++.h>

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

class OutParser {
private:
    FILE *fout;
    char *buff;
    int sp;
    void write_ch(char ch) {
        if (sp == 50000) {
            fwrite(buff, 1, 50000, fout);
            sp = 0;
            buff[sp++] = ch;
        } else {
            buff[sp++] = ch;
        }
    }
public:
    OutParser(const char* name) {
        fout = fopen(name, "w");
        buff = new char[50000]();
        sp = 0;
    }
    ~OutParser() {
        fwrite(buff, 1, sp, fout);
        fclose(fout);
    }
    OutParser& operator << (int vu32) {
        if (vu32 <= 9) {
            write_ch(vu32 + '0');
        } else {
            (*this) << (vu32 / 10);
            write_ch(vu32 % 10 + '0');
        }
        return *this;
    }
    OutParser& operator << (char ch) {
        write_ch(ch);
        return *this;
    }
    OutParser& operator << (const char *ch) {
        while (*ch) {
            write_ch(*ch);
            ++ch;
        }
        return *this;
    }
};
InParser fin("secventa.in");
OutParser fout("secventa.out");

int main() {
    int N, K;
    fin >> N >> K;
    deque<pair<int,int>> Q;
    for(int i = 1; i <= K; ++i) {
        int x;
        fin >> x;
        while(!Q.empty() && Q.back().first > x)
            Q.pop_back();
        Q.emplace_back(x, i);
    }
    int st = 1, dr = K, ans = Q.front().first;
    for(int i = K + 1; i <= N; ++i) {
        int x;
        fin >> x;
        if(!Q.empty() && Q.front().second == i - K)
            Q.pop_front();
        while(!Q.empty() && Q.back().first > x)
            Q.pop_back();
        Q.emplace_back(x, i);
        if(Q.front().first > ans) {
            ans = Q.front().first;
            st = i - K + 1;
            dr = i;
        }
    }
    fout << st << ' ' << dr << ' ' << ans;
}