/*http://www.infoarena.ro/problema/secventa*/
#include <fstream>
#include <deque>

using namespace std;
deque<short> Q;
short v[500000];
int main()
{
    int n, k, d, i, rez=-30000;
    ifstream f("secventa.in");
    ofstream g("secventa.out");
    f >> n >> k;
    for(i=0; i<n; ++i)
        f >> v[i];
    k--;
    for(i=0; i<k; ++i)
    {
        while(!Q.empty() && v[Q.back()] > v[i]) Q.pop_back();
        Q.push_back(i);
    }
    for(i=k; i<n; ++i)
    {
        while(!Q.empty() && v[Q.back()] > v[i]) Q.pop_back();
        Q.push_back(i);
        if(v[Q.front()] > rez)
        {
            rez = v[Q.front()];
            d = i;
        }
/*
        printf("\n");
        for(int j=0; j<Q.size(); ++j)
            printf("%d ", v[Q[j]]);*/
        if(i - Q.front() >= k) Q.pop_front();
    }
    g << d-k+1 << " " << d+1 << " " << rez << "\n";
    f.close();
    g.close();
    return 0;
}