#include <fstream>
#include <deque>

using namespace std;

int n, k, Max = -30010, x;
int v[500010];
deque <int> d;

void Read()
{
    ifstream fin("secventa.in");
    fin >> n >> k;
    for (int i = 1;i <= n;++i)
        fin >> v[i];
    fin.close();
}

void Solve()
{
    for (int i = 1;i <= n;++i)
    {
        while(!d.empty() && v[d.back()] >= v[i])
            d.pop_back();
        d.push_back(i);
        if (i - k == d.front())
            d.pop_front();
        if (i >= k)
        {
            if (Max < v[d.front()])
            {
                Max = v[d.front()];
                x = d.front();
            }
        }
    }
}

void Write()
{
    ofstream fout("secventa.out");
    fout << x << " " << x + k - 1 << " " << Max << "\n";
    fout.close();
}

int main()
{
    Read();
    Solve();
    Write();
    return 0;
}