#include <fstream>
#include <algorithm>
#include <deque>

using namespace std;
typedef long long ll;

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

deque <int> deck;

const int NMAX = 500005;
int v[NMAX];
int lt[NMAX];
int rt[NMAX];
int k, n;
int start, finish, val;

int main()
{
    fin >> n >> k;
    for(int i = 1; i <= n; i++) {
        fin >> v[i];
        while(!deck.empty() && v[i] < v[deck.front()])
            deck.pop_front();

        if(!deck.empty())
            lt[i] = deck.front() + 1;
        else lt[i] = 1;

        deck.push_front(i);
    }
    deck.clear();

    for(int i = n; i >= 1; i--) {
        while(!deck.empty() && v[i] < v[deck.front()])
            deck.pop_front();

        if(!deck.empty())
            rt[i] = deck.front() - 1;
        else rt[i] = n;

        deck.push_front(i);
    }
    for(int i = 1; i <= n; i++) {
        if(rt[i] - lt[i] + 1 < k) continue;

        if(v[i] > val) {
            val = v[i];
            start = lt[i];
            finish = max(i, lt[i] + k - 1);
        } else if(v[i] == val) {
            if(rt[i] < start) {
                start = lt[i];
                finish = max(i, lt[i] + k - 1);
            } else if(rt[i] == start && max(i, rt[i] + k - 1) < finish)
                finish = max(i, lt[i] + k - 1);
        }
    }
    fout << start << " " << finish << " " << val;
    return 0;
}