#include <bits/stdc++.h>
const int MAX_N = 500005;
using namespace std;

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

int n, k, a[MAX_N];
deque<int>q;

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