#include <fstream>
#include <deque>
using namespace std;

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

deque < int > D;
int a[500005], n, k, inc, sf, minim;

int main()
{
    f>>n>>k;
    for (int i=1; i<=n; i++) f>>a[i];

    for (int i=1; i<=n; i++)
    {
        while (D.size() && D.front()<=i-k) D.pop_front();
        while (D.size() && a[i]<=a[D.back()]) D.pop_back();
        D.push_back(i);

        if (i>=k && minim<a[D.front()]) minim=a[D.front()], inc=i-k+1, sf=i;
    }
    g<<inc<<' '<<sf<<' '<<minim<<'\n';
    return 0;
}