/*
    "TLE is like the wind, always by my side"
    - Yasuo - 2022 -
*/
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define debug(x) cerr << #x << " " << x << "\n"
#define debugs(x) cerr << #x << " " << x << " "

using namespace std;

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

deque <int> dq;
int v[500001];

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n,k,i,mx,is;
    fin >> n >> k;
    mx=-1;
    for (i=1; i<=n; i++)
    {
        fin >> v[i];
        while (dq.size() && v[i]<=v[dq.back()])
            dq.pop_back();
        if (dq.front()==i-k)
            dq.pop_front();
        dq.push_back(i);
        if (i>=k)
        {
            if (v[dq.front()]>mx)
            {
                mx=v[dq.front()];
                if (dq.front()<=n-k+1)
                is=dq.front();
                else
                is=n-k+1;
            }
        }
    }
    fout << is << " " << is+k-1 << " " << mx;
}