#include <bits/stdc++.h>
using namespace std;
ifstream in("secventa.in"); ofstream out("secventa.out");
deque <int> dq;
int v [500001];
int n,k,poz1,poz2,baza=INT_MIN;
char s [30005];
int main() {
	in>>n>>k;
	for(int i=1;i <=n;++i)
	    {
	        in >>s;
	        v [i]=atoi (s);
	        while (!dq.empty ()&&v [i]<=v [dq.back ()]) dq.pop_back();
	        dq.push_back (i); 
	        if (dq.front ()==i-k) dq.pop_front ();
	        if (i>=k&&v[dq.front ()]>baza) 
	        {
	            poz1=i-k+1; poz2=i;baza=v [dq.front ()]; 
	        }
	        
	    }
	    out<<poz1 <<" "<<poz2<<" " <<baza;
	return 0;
}