//
//  main.cpp
//  Secventa
//
//  Created by Darius Buhai on 23/10/2018.
//  Copyright © 2018 Darius Buhai. All rights reserved.
//

#include <iostream>
#include <fstream>
#include <deque>

using namespace std;

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

long n, k, x, ls;

deque<pair<int,int>> s;

void secvente()
{
    fin>>n>>k;
    for(int i=0;i<n;i++)
    {
        pair<int, int> nx;
        fin>>nx.second;
        nx.first = i;
        if(!s.empty() && nx.second>s.front().second && n-i>=k)
        {
            s.clear();
            s.push_back(nx);
            ls = 1;
        }else if(ls<k)
        {
            s.push_back(nx);
            ls++;
        }
    }
    if(!s.empty())
        fout<<s.front().first+1<<" "<<s.back().first+1<<" "<<s.front().second;
}

int main() {
    secvente();
    return 0;
}