#include <bits/stdc++.h>

using namespace std;

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

int n,k,maxim = -1e9,st,dr;
int a[500005];
deque<pair<int,int>>d;

int main()
{
    in >> n >> k;
    for (int i = 1; i <= n; i++)
        in >> a[i];
    for (int i = 1; i <= n; i++)
    {
        while (d.size() and d.front().second < i - k + 1)
            d.pop_front();
        while (d.size() and d.back().first >= a[i])
            d.pop_back();
        d.push_back(make_pair(a[i],i));
        if (i >= k and d.front().first > maxim)
        {
            maxim = d.front().first;
            st = i - k + 1;
            dr = i;
        }
    }
    out << st << " " << dr << " " << maxim;
    return 0;
}