#include<fstream>
#include<deque>
using namespace std;

deque<int > Q;
int a[500005];
int n, k;
int maxim = -1000000, pozi, pozf;

void solve();

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

void solve()
{
	ifstream fin("secventa.in");
	ofstream fout("secventa.out");
	
	fin >> n >> k;
	for(int i = 1; i <= n; ++i)
	{
		fin >> a[i];
		
		while( !Q.empty() && a[i] < a[Q.back() ] )
			Q.pop_back();
		
		Q.push_back(i);
		
		if( i - k == Q.front() )
			Q.pop_front();
		
		if( i >= k && maxim < a[Q.front() ] )
		{
			maxim  = a[Q.front() ];
			pozi = i - k + 1;
			pozf = i;
		}
	}
	
	fout << pozi << " "<<pozf << " " << maxim;

	fin.close();
	fout.close();
}