#include <bits/stdc++.h>

using namespace std;

int n, k;
deque <int> q;
int st, dr, mn = LONG_MIN;
int a[500005];

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

    fin >> n >> k;

    int i, x;

    for(i = 1; i <= k; i++)
    {
        fin >> x;
        a[i] = x;
        while(!q.empty() && x < a[q.back()])
            q.pop_back();
        q.push_back(i);
    }

    for(i = k + 1; i <= n; i++)
    {
        fin >> x;
        a[i] = x;
        while(!q.empty() && x < a[q.back()])
            q.pop_back();
        q.push_back(i);

        if(!q.empty() && q.front() < i - k + 1)
            q.pop_front();

        if(mn < a[q.front()])
        {
            st = q.front();
            dr = st + k - 1;
            mn = a[q.front()];
        }
    }
    fout << st << " " << dr << " " << mn << "\n";
}

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