#include <fstream>
#include <deque>
#include <climits>

using namespace std;

ofstream fout("secventa.out");

int N, K, maxEl = INT_MIN, st, dr, v[500005];
deque <int> deq;

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");

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

    for(int i = 1; i <= N; i++)
    {
        while(!deq.empty() && v[i] <= v[deq.back()])
            deq.pop_back();
        deq.push_back(i);

        if(deq.back() - deq.front() >= K)
            deq.pop_front();

        if(i >= K)
        {
            if(v[deq.front()] > maxEl)
            {
                maxEl = v[deq.front()];
                st = i - K + 1;
                dr = i;
            }
        }
    }

    fout << st << ' ' << dr << ' ' << maxEl;

    return 0;
}