#include <bits/stdc++.h>

using namespace std;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
int v[500011], n, k, Max = INT_MIN, ls;
deque<int> d;
int main()
{
    fin >> n >> k;
    for(int i = 1; i <= n; ++ i)
        fin >> v[i];
    for(int i = 1; i <= n; ++ i)
    {
        while(!d.empty() && v[i] <= v[d.back()])
            d.pop_back();
        d.push_back(i);
        if(i - d.front() == k)
            d.pop_front();
        if(i >= k)
            if(v[d.front()] > Max)
            {
                Max = v[d.front()];
                ls = i;
            }
    }
    fout << ls - k + 1 <<" " << ls <<" " << Max;
    return 0;
}