#include <iostream>
#include <fstream>
#include <deque>
using namespace std;
ifstream in("secventa.in");
ofstream out("secventa.out");
const int maxn = 500005;
int dq[maxn];
int v[maxn];
int main()
{
    int n, k;
    in >> n >> k;
    for(int i = 1; i <= n; i++)
        in >> v[i];
    int mx = -(1 << 30);
    int poz = 0;
    int first = 1;
    int last = 1;
    for(int i = 1; i <= n; i++)
    {
        while(last - first && v[dq[last]] > v[i])
            last--;
        dq[++last] = i;
        //while(!dq.empty() && v[dq.back()] >= v[i])
        //   dq.pop_back();
        if(last - first && dq[first] <= i - k)
            first++;
        if(mx < v[dq[first]] && k <= i)
        {
            mx = v[dq[first]];
            poz = i - k + 1;
        }
    }
    out << poz << " " << poz + k - 1 << " " << mx << "\n";
    return 0;
}