#include <fstream>
#include <queue>
using namespace std;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
struct RaresHolmes{
int val,poz;
}a[500001];
long long n, k,mini,c1,c2,i,capat1,capat2;
deque <RaresHolmes> q;
int main()
{
    fin >> n >> k;
    for(int i = 1; i <= k; i++)
    {
        fin >>a[i].val;
        a[i].poz=i;
        while(!q.empty()&&q.back().val>a[i].val)
            q.pop_back();
        q.push_back(a[i]);
    }
    mini=q.front().val;c1=1,c2=k;
    capat1=1;capat2=k;
    for(i=k+1;i<=n;i++)
    {
        fin>>a[i].val;a[i].poz=i;capat1++;capat2++;
        if(q.front().poz<capat1)
            q.pop_front();
        while(!q.empty()&&q.back().val>a[i].val)
            q.pop_back();
        q.push_back(a[i]);
        if(q.front().val>mini)
            mini=q.front().val,c1=capat1,c2=capat2;
    }
    //while(c2<n && a[c2+1].val>mini)
        //c2++;
    //while(c1>1 && a[c1-1].val>mini)
      //  c1--;
    fout<<a[c1].poz<<' '<<a[c2].poz<<' '<<mini;
    return 0;
}