#include <bits/stdc++.h>
using namespace std;
ifstream fin ("secventa.in");
ofstream fout ("secventa.out");
#define MAXN 500003
int v [MAXN], N, K;
int p, ans = -1000000003;
deque <int> dq;
int main (){
    fin >> N >> K;
    for (int i = 1; i <= N; i ++)fin >> v [i];
    for (int i = 1; i <= N; i ++){
        while (!dq.empty () && v [i] < v [dq.back ()])
            dq.pop_back ();
        dq.push_back (i);
        if (dq.front () == i - K)dq.pop_front ();
        if (i - K >= 0 && ans < v [dq.front ()])
            ans = v [dq.front ()], p = dq.back ();
    }
    fout << p - K + 1 << " " << p << " " << ans;
    return 0;
}