#include <iostream>
#include <fstream>
#include <deque>

using namespace std;

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

int a[500001];
deque <int> q;

int main()
{
    int n,k;
    in>>n>>k;
    for (int i=1;i<=n;i++)
        in>>a[i];
    for (int i=1;i<=k;i++)
    {
        int x=a[i];
        while (!q.empty() && a[q.back()]>=x)
            q.pop_back();
        q.push_back(i);
    }
    int maxx=a[q.front()];
    int ind=k;
    for (int i=k+1;i<=n;i++)
    {
        int x=a[i];
        while (!q.empty() && a[q.back()]>=x)
            q.pop_back();
        q.push_back(i);
        if (q.front()<i-k+1)
            q.pop_front();

        if (a[q.front()]>maxx)
        {
            maxx=a[q.front()];
            ind=i;
        }
    }
    out<<ind-k+1<<' '<<ind<<' '<<maxx;
    return 0;
}