#include <fstream>

using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");

int v[500001], dq[500001];

int main()
{   
	int maxim=-32000, stop, start, n, k, i, p=1, u=0;
	
	f>>n>>k;
	
	for(i=1;i<=n;++i)
	{
		f>>v[i];
		
		while(p<=u&&v[i]<=v[dq[u]])
			--u;
		
		dq[++u]=i;
		
		if(i-dq[p]==k)
			++p;
		
		if(i>=k&&v[dq[p]]>maxim)
		{  
			maxim=v[dq[p]];
			start=dq[p-1]+1;
			stop=i;
		}
	}
	g<<start<<" "<<stop<<" "<<maxim;
	return 0;
}