#include <fstream>
#include <deque>
using namespace std;
ifstream cin ("secventa.in");
ofstream cout ("secventa.out");
int n, k, x;
deque<int> dq;
int v[500005];
int maxx = -30005;
int poz;
int main()
{
cin >> n >> k;
for (int i = 1; i <= n; i++)
{
cin >> v[i];
while (!dq.empty() && v[i] < v[dq.back()])
{
dq.pop_back();
}
dq.push_back(i);
if (i - dq.front() == k)
{
dq.pop_front();
}
if (v[dq.front()] > maxx && i >= k)
{
maxx = v[dq.front()];
poz = i;
}
}
cout << poz - k + 1 << " " << poz << " " << maxx;
return 0;
}