#include <bits/stdc++.h>
using namespace std;
int a[100001];
ifstream f("secventa.in");
ofstream g("secventa.out");
deque <int> D;
int n,k,dmaxx,d,u;
int main()
{   f>>n>>k;
    for(int i=1;i<=n;i++)
    {   f>>a[i];
        while(!D.empty() and a[i]<a[D.back()]) D.pop_back();
        D.push_back(i);
        if(D.front()<=i-k) D.pop_front();
        if(i>=k)
        {   d=a[D.front()];
            if(d>dmaxx) {dmaxx=d; u=D.front();}
        }
    }
    g<<u<<" "<<u+k-1<<" "<<dmaxx;
    g.close();
    return 0;
}