#include <bits/stdc++.h>

using namespace std;

int n, k;
vector <int> v;
deque <int> dq;

int main()
{
    ios_base ::sync_with_stdio(0);
    cin.tie(0);

    freopen("secventa.in", "r", stdin);
    freopen("secventa.out", "w", stdout);

    cin >> n >> k;
    v.resize(n + 1);

    for(int i = 1; i <= k; i ++)
    {
        cin >> v[i];
        while(!dq.empty()  &&  v[i] < dq.back())
            dq.pop_back();
        dq.push_back(v[i]);
    }

    int maxBase = -30000, index;
    if(dq.front() > maxBase)
    {
        maxBase = dq.front();
        index = 1;
    }

    for(int i = k + 1; i <= n; i ++)
    {
        cin >> v[i];

        if(!dq.empty()  &&  dq.front() == v[i - k])
            dq.pop_front();

        while(!dq.empty()  &&  v[i] < dq.back())
            dq.pop_back();
        dq.push_back(v[i]);
//        cout << i << " " << dq.front() << "\n";

        if(dq.front() > maxBase)
        {
            maxBase = dq.front();
            index = i - k + 1;
        }
    }

    cout << index << " " << index + k - 1 << " " << maxBase;
    return 0;
}