#include <bits/stdc++.h>
#define ll long long
using namespace std;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
int main(){
    int n, k, l = 1, r = k, mx = INT_MIN;
    fin >> n >> k;
    vector<int> v(n+1);
    deque<int> dq; // min-deque: front = index of minimum in window
    for(int i = 1; i <= n; i++){
        fin >> v[i];
        // maintain increasing deque (front = min)
        while(!dq.empty() && v[i] <= v[dq.back()]) dq.pop_back();
        dq.push_back(i);
        // remove elements outside the window of size k
        if(dq.front() == i - k) dq.pop_front();
        // only consider full windows of size exactly k
        if(i >= k){
            int window_min = v[dq.front()];
            if(window_min > mx){
                mx = window_min;
                l = i - k + 1;
                r = i;
            }
        }
    }
    fout << l << ' ' << r << ' ' << mx;
    return 0;
}