#include <iostream>
#include <deque>
#include <utility>
#include <fstream>
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
int main()
{
    deque < pair <int,long> > my_deq;
    long n,k,i;
    int x;
    f>>n;
    f>>k;
    f>>x;
    if (k==n)
        {g<<1<<" "<<n<<" "<<x;}
    else {
    my_deq.push_back(make_pair(x,1));
    for (i=2;i<=n;i++)
    {
        f>>x;
        if (my_deq.back().first<x&&k<=n-i+1){
           my_deq.push_back(make_pair(x,i));}
    }
    /*while (!my_deq.empty()){
        cout<<my_deq.front().first;
        my_deq.pop_front();}*/
    x=my_deq.back().second;
    if (k==1)
        g<<x<<" "<<x+1<<" "<<my_deq.back().first;
    else
        g<<x<<" "<<x+k-1<<" "<<my_deq.back().first;}
    f.close();
    g.close();
    return 0;
}