#include <bits/stdc++.h>

using namespace std;

ifstream f ("secventa.in");
ofstream g ("secventa.out");

const int NMAX = 5e5;

deque<int> dq;
int v[NMAX+1];

int main()
{
    int n, k;
    
    f >> n >> k;
    for(int i=1; i<=n; i++)
        f >> v[i];
        
    int mx = -1e9;
    int st = -1, dr = -1;
    
    for(int i=1; i<=n; i++){
        
        if(!dq.empty() and i - k == dq.front())
            dq.pop_front();
        
        while(!dq.empty() and v[i] < v[dq.back()])
            dq.pop_back();
        
        dq.push_back(i);
            
        if(!dq.empty() and i >= k and mx < v[dq.front()]){
            mx = v[dq.front()];
            dr = i;
            st = i-k+1;
        }
        
    }
    
    g << st << ' ' << dr << ' ' << mx;

    return 0;
}