#include <iostream>
#include <deque>
 
using namespace std;
 
struct item {
    int val;
    int pos;
};
 
int main (void) {
    ios_base::sync_with_stdio(false);
     
    freopen("secventa.in", "r", stdin);
    freopen("secventa.out", "w", stdout);
         
    int n, k;
     
    cin >> n >> k;
    int v[n];
     
    deque<int> l;
     
    int max = 0, endSol = 0;
     
    for (int i = 0; i < k; ++i) {
        cin >> v[i];
        l.push_back(i);
    }
         
         
    max = v[l.front()];
    endSol = l.front();
     
    for (int i = k; i < n; ++i) {    
        cin >> v[i];
        while (!l.empty() && v[i] <= v[l.back()]) {
            l.pop_back();
        }
         
        l.push_back(i);
         
        while (l.front() <= i - k) l.pop_front();
         
        if (v[l.front()] > max) {
            max = v[l.front()];
            endSol = i;
        }
    }
     
    cout << endSol - k + 2 << " " << endSol + 1 << " " << max;
     
    return 0;
}