#include <bits/stdc++.h>

using namespace std;

const int Nmax = 5e5+5;

int n, k, i, a[Nmax], ind, ans = -33000;
deque<int> dq;

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 f("secventa.in");
    ofstream g("secventa.out");

    f >> n >> k;

    for(i=1; i<=n; ++i)
    {
        f >> a[i];

        if(dq.size() && dq.front()==i-k) dq.pop_front();
        while(dq.size() && a[dq.back()]>=a[i]) dq.pop_back();

        dq.push_back(i);

        if(i>=k && ans < a[dq.front()])
            ans = a[dq.front()], ind = i;
    }

    g << ind-k+1 << " " << ind << " " << ans << '\n';

    return 0;
}