#include <bits/stdc++.h>

#define NMAX 500005
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 fin("secventa.in");
ofstream fout("secventa.out");

int v[NMAX];
deque<pair<int, int> > dq;

int main()
{
    int n, k;
    fin >> n >> k;

    for(int i = 1; i <= n; ++i)
        fin >> v[i];

    for(int i = 1; i <= k; ++i){
        while(!dq.empty() && dq.back().first >= v[i])
            dq.pop_back();
        dq.push_back({v[i], i});
    }

    int st = 1, dr = k, val = dq.front().first;
    for(int i = k + 1; i <= n; ++i){
        if(!dq.empty() && dq.front().second == i - k)
            dq.pop_front();
        while(!dq.empty() && dq.back().first >= v[i])
            dq.pop_back();
        dq.push_back({v[i], i});
        if(dq.front().first > val){
            val = dq.front().first;
            dr = i;
            st = i - k + 1;
        }
    }

    fout << st << ' ' << dr << ' ' << val << '\n';
    return 0;
}