#include <stdio.h>
#include <deque>
#include <fstream>

using namespace std;

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

const int maxn = 500001;
int n, k;
int a[maxn];

void citire()
{
    in >> n >> k;
    for (int i = 1; i <= n; ++i)
        in >> a[i];
}

void brut()
{
    int inc, sf, maxim = -1000000000;
    for (int i = 1; i <= n - k + 1; ++i)
    {
        int min = a[i];
        for (int j = i; j <= i + k - 1; ++j)
            if (a[j] < min)
                min = a[j];

        if (min > maxim)
        {
            maxim = min;
            inc = i;
            sf = i + k - 1;
        }
    }

    out << inc << ' ' << sf << ' ' << maxim;
}

void optim()
{
    int maxim = -1000000000, inc, sf;

    deque<int> d;
    for (int i = 1; i < k; ++i)
    {
        while (!d.empty() && a[ d.back() ] > a[i])
            d.pop_back();
        if (!d.empty() && d.front() <= i - k)
            d.pop_front();

        d.push_back(i);
    }

    for (int i = k; i <= n; ++i)
    {
        while (!d.empty() && a[ d.back() ] > a[i])
            d.pop_back();
        if (!d.empty() && d.front() <= i - k)
            d.pop_front();

        d.push_back(i);
        if (a[ d.front() ] > maxim)
        {
            maxim = a[ d.front() ];
            inc = i - k + 1;
            sf = i;
        }
    }

    out << inc << ' ' << sf << ' ' << maxim;
}

int main()
{
    citire();
    //brut();
    optim();

    return 0;
}