#include <bits/stdc++.h>

using namespace std;

ifstream f("secventa.in");
ofstream g("secventa.out");

int n,k;

int main()
{
    f >> n >> k;

    priority_queue <int, vector<int>, greater<int> > pq;
    int maxi=-1,st=0,dr=0;

    for (int i=1; i<=n; i++ )
    {
        int x; f >> x;
        pq.push(x);

        if ( pq.size()==k )
        {
            if ( pq.top()>maxi )
            {
                maxi=pq.top();
                dr=i;
                st=i-k+1;
            }
            pq.pop();
        }
    }

    g << st << " " << dr << " " << maxi;
    return 0;
}