#include <bits/stdc++.h>
const int nmax = 1e6;
using namespace std;
int v[nmax];
ifstream fin("secventa.in");
ofstream fout("secventa.out");
deque <int> q;
int main()
{
    int n, k, i;
    fin >> n >> k;
    for(i=1;i<=n;i++){
        fin >> v[i];
        while(!q.empty() && v[q.back()] > v[i]){
            q.pop_back();
        }
        q.push_back(i);
        if(i>k && q.front()==i-k){
            q.pop_front();
        }
    }
    fout << i-k << " " << i-1 << " " << v[q.front()];
}