#include <bits/stdc++.h>

using namespace std;

deque <int> q;
int a[500010];
int n, k;
void Citire()
{
    ifstream fin("secventa.in");
    fin >> n >> k;
    for(int i = 1; i <= n; i++)
        fin >> a[i];

    fin.close();
}
 void Secventa()
{
    int bazmax;
    int x, i, u, y;

    for(i = 1; i <= k; i++)
    {
        x = a[i];
       while(!q.empty() && x <= a[q.back()])
            q.pop_back();
       q.push_back((i));
    }
    bazmax = a[q.front()];

    for(i = k+1; i <= n; i++)
    {
        x = a[i];
        u = i;
        while(!q.empty() && x <= a[q.back()])
            q.pop_back();
        q.push_back(i);

         if(i - q.front() >= k)
           q.pop_front();

       if(bazmax < a[q.front()])
       {   bazmax = a[q.front()];
           u = i;
           y = q.front();

       }

    }

    ofstream fout("secventa.out");
    fout << y << " " << u << " "<<bazmax;


}
int main()
{
   Citire();
   Secventa();
    return 0;
}