#include <deque>
#include <fstream>
#define pb push_back
#define mp make_pair
using namespace std;

deque <int> DE;
int n, k, x[500001], rez = -(1 << 30), poz;

int main() {
    ifstream r("secventa.in");
    ofstream w("secventa.out");
    r >> n >> k;
    for (int i = 1; i <= n; i++) {
        r >> x[i];
        while (!DE.empty() && x[i] <= x[DE.back()])
            DE.pop_back();
        DE.push_back(i);
        if (i - DE.front() == k)
            DE.pop_front();
        if (i >= k && x[DE.front()] > rez) {
            rez = x[DE.front()];
            poz = i;
        }
    }
    w << poz - k + 1 << " " << poz << " " << rez;
    return 0;
}