#include<fstream>
#include<deque>

using namespace std;


const int N = 500003;
int n,k,i,a[N],res=-1000000,poz;
deque<int> q;

int main()
{
    ifstream cin("secventa.in");
    ofstream cout("secventa.out");

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

        if (i<k)continue;
        if (q.front()==i-k) q.pop_front();
        if (res<a[q.front()]) res=a[q.front()],poz=i-k+1;
    }
    cout << poz << " " << poz + k - 1 << " " << res;
    return 0;
}