#include <bits/stdc++.h>
#define fx first
#define sx second
#define pb push_back
typedef long long ll;
const int Max = 100006;
const int Inf = 2e9;
const int MOD = 666013;
using namespace std;

ifstream in("secventa.in");
ofstream out("secventa.out");

deque <int> q;

void solve () {
	int n, k;
	in >> n >> k;
	int a[n+6];
	for (int i=1; i<=n; i++) in >> a[i];
	ll mn_ans = -2e9, l = 1, r = k;
	for (int i=1; i<=n; i++) {
//		add_in(a[i]);
		while (!q.empty() && q.back() > a[i]) q.pop_back();
		q.push_back(a[i]);	
		if (i - k > 0) {
//			remove(a[i-k]);
			if (q.front() == a[i-k]) q.pop_front();
		}
		if (i >= k && !q.empty() && q.front() > mn_ans) {
			mn_ans = q.front();
			l = i-k+1;
			r = i;
		}
	}
	out << l << " " << r << " " << mn_ans << "\n";
	return;
}

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int t=1;
//	cin >> t;
	while (t--) {
		solve();
	}
	return 0;
}