#include <cstdio>
#include <deque>
using namespace std;
const char FIN[] = "secventa.in";
const char FOU[] = "secventa.out";
const int MAXN = 500010;
int  n, k, a[MAXN], aMax = -31000, r = 0;
deque<int> dq;

int main(){
    freopen(FIN,"r",stdin);
    freopen(FOU,"w",stdout);
    scanf("%d%d",&n,&k);
    for (int i = 1; i <= n; i++) scanf("%d",&a[i]);
    for (int i = 1; i <= n; i++){
        while (!dq.empty() && a[i] <= a[dq.back()]) dq.pop_back();
        dq.push_back(i);
        if (dq.front() == i-k) dq.pop_front();
        if  (i >= k) {
            aMax = max(aMax, a[dq.front()]);
            r = i;
        }
    }
    printf("%d %d %d\n",r-k+1, r, aMax); fflush (stdout);
    return  0;
}