#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <vector>
#include <iostream>
#include <set>
#include <deque>
#include <fstream>

using namespace std;
ifstream fin("secventa.in");
ofstream fout("secventa.out");

#define NMAX 500010

deque<pair<int, int>> Q;
int n, x, k, istart, ifinish, k1, nr, semn, maxi = -200000000;
int v[NMAX];
char c[2000009];

int main()
{
    fin>>n>>k1; fin.get();
	semn=1;
	fin.getline (c,2000000);
	for(int i=0; c[i]!=0; i++){
		if(c[i]=='-') {
			semn=-1;
			continue;
		}
		if(c[i]==' ') v[++k]=nr*semn, semn=1, nr=0;
		else nr=nr* 10+(c[i]-'0');
	}
	v[++k]=nr;
	k = k1;
    istart = ifinish = 1;
    for(int i = 1; i <= n; i++)
    {
        while(Q.size() && Q.back().second > v[i])
            Q.pop_back();
        Q.push_back(make_pair(i, v[i]));
        if(Q.front().first == i - k)
              Q.pop_front();
        if(Q.front().second > maxi && i >= k) {
            maxi = Q.front().second;
            istart = i - k + 1;
            ifinish = i;
        }
    }
    fout<<istart<<' '<<ifinish<<' '<<maxi;
    return 0;
}