#include <bits/stdc++.h>

using namespace std;
deque <int> dq;
int v[500005];
int main()
{
    ifstream cin("secventa.in");
    ofstream cout("secventa.out");
    int n, k, lr, rr, mx = -30005, a;
    cin >> n >> k;
    for(int i = 0; i < n; i++){
        cin >> v[i];
        if(i >= k  &&  dq.front() <= i - k){
            dq.pop_front();
        }
        while(!dq.empty()  &&  v[dq.back()] > v[i]){
            dq.pop_back();
        }
        dq.push_back(i);
        if(mx < v[dq.front()]  &&  i >= k - 1){
            mx = v[dq.front()];
            rr = i;
            lr = i - k + 1;
        }
    }
    cout << lr + 1 << " " << rr + 1 << " " << mx;
    return 0;
}