#include <iostream>
#include <fstream>
#include <deque>
using namespace std;

#define nmax 500001
ifstream in("secventa.in");
ofstream out("secventa.out");

int N,K,i,St,Dr,Max = -30001;
int V[nmax],Viz[nmax];
deque <int> deq;

int main() {
    
    in >> N >> K;
    
    for (i=1; i<=N; i++) {
        in >> V[i];
        
        while(!deq.empty() && V[deq.back()] > V[i]) deq.pop_back(), Viz[i]++;
        
        deq.push_back(i);
        
        if (deq.front() < i - K + 1 && i >= K) deq.pop_front();
        
        if (V[deq.front()] > Max && i >= K){
            Max = V[deq.front()];
            
            St = deq.front() - Viz[deq.front()],
            Dr = St + K - 1;
        }
    
    }
    
    out << St << " " << Dr << " " << Max << "\n";
    
    return 0;
}