#include <fstream>
#include <deque>
#define MAX 500001

using namespace std;

int n, k, a[MAX];

int main()
{
    deque<int> q, p;
    int i, sol = -32000, mini, minj;
    
    ifstream fin("secventa.in");
    fin >> n >> k;
    for (i = 1; i <= n; i++)    
        fin >> a[i];
    fin.close();
    
    ofstream fout("secventa.out");
    
    for (i = 1; i <= n; i++)
    {
        while (!q.empty() && q.back() >= a[i])    
        {
            q.pop_back();    
            p.pop_back();
        }
        while (!q.empty() && p.front() <= i-k)
        {
            q.pop_front();
            p.pop_front();    
        }
        q.push_back(a[i]);
        p.push_back(i);
        
        if (sol < q.front())
        {
            sol = q.front();
            mini = p.front();
            minj = p.back();    
        }    
    }
    fin.close();
    
    fout << mini << " " << minj << " " << sol;
    fout.close();
    
    return 0;
}