#include <iostream>
#include <fstream>
#include <deque>

using namespace std;

class InputReader {
    public:
        InputReader() {}
        InputReader(const char *file_name) {
            input_file = fopen(file_name, "r");
            cursor = 0;
            fread(buffer, SIZE, 1, input_file);
        }
        inline InputReader &operator >>(int &n) {
            while(buffer[cursor] < '0' || buffer[cursor] > '9') {
                advance();
            }
            n = 0;
            while('0' <= buffer[cursor] && buffer[cursor] <= '9') {
                n = n * 10 + buffer[cursor] - '0';
                advance();
            }
            return *this;
        }
    private:
        FILE *input_file;
        static const int SIZE = 1 << 17;
        int cursor;
        char buffer[SIZE];
        inline void advance() {
            ++ cursor;
            if(cursor == SIZE) {
                cursor = 0;
                fread(buffer, SIZE, 1, input_file);
            }
        }
};

InputReader fin("secventa.in");
ofstream fout("secventa.out");

struct minim
{
    int val;
    int st;
    int dr;
};

const int NMAX = 5000000 + 5;

deque <int> dq;

minim minn;

int n, k, K;
long long int sum;
int v[NMAX];

void read()
{
    fin >> n >> k;
    for (int i = 1; i <= n; ++i)
        fin >> v[i];
    minn.val = -999999;
}

int main()
{
    read();
    for (int i = 1; i <= n; ++i)
    {
        //scoti de la inceput cat e nevoie
        //scoti de la sfarsit a.i sa fie cresc
        //add
        //verif daca i >= k
        while (!dq.empty() && dq.front() < i - k + 1)
            dq.pop_front();

        while (!dq.empty() && v[dq.back()] > v[i])
            dq.pop_back();

        dq.push_back(i);

        if (i >= k && minn.val < v[dq.front()])
        {
            minn.val = v[dq.front()];
            minn.st = i - k + 1;
            minn.dr = i;
        }
    }
    fout << minn.st << " " << minn.dr << " " << minn.val << '\n';
    return 0;
}