#include <bits/stdc++.h>

using namespace std;

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

deque <int> coada;
int n, a[5000005], k;
long long maxim = -(1 << 30), dr;


int main()
{
    fin >> n >> k;
    for (int i = 1; i <= n; ++i)
    {
        fin >> a[i];
    }
    for (int i = 1; i <= n; ++i)
    {
        while (coada.size() > 0 && a[i] < a[coada.back()]) coada.pop_back();
        coada.push_back(i);
        if (i > k && coada.size() > 0)
        {
            if (coada.front() == i - k) coada.pop_front();
        }
        if (i >= k)
        {
            if (coada.size() > 0)
                if (a[coada.front()] > maxim)
                    maxim = a[coada.front()], dr = i;
        }
    }
    fout << dr - k + 1 << " " << dr << " " << maxim;
    return 0;
}