#include <vector>
#include <string> 
#include <set> 
#include <map> 
#include <queue> 
#include <bitset> 
#include <stack>
#include <list>

#include <numeric> 
#include <algorithm> 

#include <cstdio>
#include <fstream>
#include <iostream> 
#include <sstream> 
#include <iomanip>

#include <cctype>
#include <cmath> 
#include <ctime>
#include <cassert>

using namespace std;

#define LL long long
#define PII pair <int, int>
#define VB vector <bool>
#define VI vector <int>
#define VD vector <double>
#define VS vector <string>
#define VPII vector <pair <int, int> >
#define VVI vector < VI >
#define VVB vector < VB >

#define FORN(i, n) for(int i = 0; i < (n); ++i)
#define FOR(i, a, b) for(int i = (a); i <= (b); ++i)
#define FORD(i, a, b) for(int i = (a); i >= (b); --i)
#define FORI(it, X) for(__typeof((X).begin()) it = (X).begin(); it !=(X).end(); ++it) 
#define REPEAT do{ 
#define UNTIL(x) }while(!(x)); 

#define SZ size()
#define BG begin() 
#define EN end() 
#define CL clear()
#define X first
#define Y second
#define RS resize
#define PB push_back
#define MP make_pair
#define ALL(x) x.begin(), x.end()

#define IN_FILE "secventa.in"
#define OUT_FILE "secventa.out"

ifstream fin(IN_FILE);
ofstream fout(OUT_FILE);

int n, k;
VI a;
deque<int> deq;

void add(int ind)
{
	while (!deq.empty() && a[deq.back()] > a[ind])
	{
		deq.pop_back();
	}
	deq.push_back(ind);
}


int main()
{
	fin.tie(NULL);
	ios_base::sync_with_stdio(false);
	fin >> n >> k;
	a.RS(n + 1);
	FOR(i, 1, k) 
	{
		fin >> a[i];
		add(i);
	}

	int best = a[deq.front()], sol = 1;
	
	FOR(i, 1, n - k)
	{
		while (!deq.empty() && deq.front() <= i)
		{
			deq.pop_front();
		}
		fin >> a[i + k];
		add(i + k);
		if (best < a[deq.front()])
		{
			best = a[deq.front()];
			sol = i + 1;
		}
	}

	fout << sol << " " << sol + k - 1 << " " << best;
	fout.close();
	fin.close();

	return 0;
}