#include <fstream>
#include<deque>
#include<vector>
using namespace std;
#define Nmax 500005
int n,k,poz,i,j;
int a[Nmax];
char s[10*Nmax];
deque<int> dq;
ifstream f("secventa.in");
ofstream g("secventa.out");
int cit(int &p)
{
int x=0,semn=1;
if(s[p]=='-'){semn=-1;p++;}

while(s[p]!=' '&& s[p]!='\0')
{
x=x*10+(s[p]-'0');
p++;
}
p++;
return semn*x;

}
int main()
{
int max;
f>>n>>k;f.get();
f.getline(s,Nmax*10);
j=0;
for(i=1;i<=k;i++)
{
a[i]=cit(j);
while(!dq.empty() && a[dq.back()]>a[i])
dq.pop_back();
dq.push_back(i);
}
max=a[dq.front()];poz=k;

for(;i<=n;i++)
{
a[i]=cit(j);
while(!dq.empty() && a[dq.back()]>a[i])
dq.pop_back();
dq.push_back(i);
if(dq.front()==i-k)dq.pop_front();
if(max<a[dq.front()])
{max=a[dq.front()];poz=i;}
}
g<<poz-k+1<<' '<<poz<<' '<<max;

return 0;
}