#include <bits/stdc++.h>

using namespace std;

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

deque <int> q;
long long n, k, v[5000005], sum, secv[500005], Max=-300005, p=1, u;

int main()
{
    fin >> n >> k;
    for (int i=1; i<=n; i++)
        fin >> v[i];
    for (int i=1; i<=n; i++)
    {
        while (!q.empty() && v[i]<=v[q.back()])
            q.pop_back();
        q.push_back(i);
        if (i>=k)
        {
            while (!q.empty() && i-q.front()>=k)
                q.pop_front();
            if (v[q.front()]>v[Max])
            {
                u=i;
                Max=q.front();
            }
        }
    }
    fout << u-k+1 << " " << u << " " << v[Max];
    return 0;
}