#include<fstream>
#include<deque>
#define NMax 50000005
 

using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
 
deque <int> Q;
int v[NMax];
long long s,smax;
int n,k,start,finish,cont;
void read()
{
     
    int i,j;
    f>>n>>k;
    for(i=1;i<=n;i++)
     f>>v[i];
     
}
void solve()
{
    int i,j;
	smax=-20000000;
    for(i=1;i<=n;i++)
    {
        while(Q.size()&&v[Q.back()]>=v[i])
        Q.pop_back();
         
        Q.push_back(i);
     
        if(Q.front()==(i-k) )
             Q.pop_front();
        if(i>=k)
        {  
			s+=v[Q.front()];
			
          if(s>smax)

		  {
			  start=Q.front();
			  finish=i;
			  cont=v[Q.front()];
			  s=0;
		  }		
		}		  
    }
     
}
void write()
{
    g<<start<<" "<<finish<<" "<<cont;
}
 
int main()
{
    int i,j;
    read();
    solve();
    write();
    return 0;
}