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

using namespace std;

ifstream f ("secventa.in");
ofstream g ("secventa.out");

int n, k;
int v[500001];
char s[3500001];
deque <int> d;

void rezolva () {
    f >> n >> k;
    f.get();
    f.get(s, 3500000);
    int semn, j = 0, sol = -1, poz = 0;
    for (int i = 1; i <= n; i++) {
        semn = 1;
        if (s[j] == '-') semn = -1, j++;
        v[i] = 0;
        while (s[j] != ' ' && s[j] != '\n') {
            v[i] = v[i] * 10 + s[j] - '0';
            j++;
            //cout << v[i] << ' ';
        }
        j++;
        v[i] *= semn;
        while (!d.empty() && v[d.back()] >= v[i]) d.pop_back();
        d.push_back(i);
        if (i - d.front() == k) d.pop_front();
        if (v[d.front()] > sol && i >= k) sol = v[d.front()], poz = i;
    }
    g << poz - k + 1 << ' ' << poz << ' ' << sol << '\n';
}


int main () {
    rezolva ();
    return 0;
}