#include <bits/stdc++.h>
using namespace std;

constexpr int NMAX = 5e5 + 5;

struct tip{
    int s, f, nr;
}sol = {INT_MAX, INT_MAX, INT_MIN};

int v[NMAX];

int main()
{
#ifndef LOCAL
    freopen("secventa.in", "r", stdin);
    freopen("secventa.out", "w", stdout);
#endif
    int N, K;
    scanf("%d%d", &N, &K);

    for(int i = 1; i <= N; ++i)
        scanf("%d", &v[i]);

    deque<int> dq;
    for(int i = 1; i <= N; ++i) {
        while(!dq.empty() && i - dq.front() + 1 > K)
            dq.pop_front();
        while(!dq.empty() && v[dq.back()] >= v[i-K+1])
            dq.pop_back();
        dq.push_back(i-K+1);
        if(i < K) continue;
        if(v[dq.front()] > sol.nr || (v[dq.front()] == sol.nr && (sol.s > i-K+1 || (sol.s == i-K+1 && sol.f > i))))
            sol = {i-K+1, i, v[dq.front()]};
    }

    printf("%d %d %d", sol.s, sol.f, sol.nr);

    return 0;
}