#include <bits/stdc++.h>

using namespace std;

int v[500001];

int main()
{
    ifstream fin("secventa.in");
    ofstream fout("secventa.out");

    int n, k;  fin >> n >> k;


    int p_max_min = 1;


    deque<int> dq;


    for(int i = 1; i <= n; ++i)
    {
        fin >> v[i];

        while(!dq.empty() && v[dq.back()] >= v[i]) dq.pop_back();

        dq.push_back(i);

        if(i >= k && v[dq.front()] > v[p_max_min]) p_max_min = dq.front();


        if(dq.front() == i - k + 1) dq.pop_front();
    }

   int first = p_max_min - 1;

   while(k && v[first] > v[p_max_min])
   {
       k--;
       first--;
   }

   fout << first + 1 << ' ' << p_max_min + k - 1 << ' ' << v[p_max_min];
}