#include <cstdio>
#include <deque>
#include <climits>
#define SIZE 500002
using namespace std;

int i, n, k, pz, pos_elem, MAX=INT_MIN, v[SIZE];
deque <int> dq;

int main()
{
    freopen("secventa.in", "r", stdin);
    freopen("secventa.out", "w", stdout);
    scanf("%d %d", &n, &k);
    for(i=1;i<=n;++i)
        scanf("%d", &v[i]);
    for(i=1;i<=n;++i)
    {
        while(!dq.empty() && v[dq.back()]>=v[i])
            dq.pop_back();
        while(!dq.empty() && i-k>=dq.front())
            dq.pop_front();
        dq.push_back(i);
        if(i>=k && v[dq.front()]>MAX)
        {
            MAX=v[dq.front()];
            pz=i-k+1;
        }
    }
    printf("%d %d %d", pz, pz+k-1, MAX);
    return 0;
}