#include<bits/stdc++.h>

 #define pa pair<int,int>

 #define ll long long

 using namespace std;

 const int maxn=1e6+;

 inline ll rd(){

     ll x=;char c=getchar();int neg=;

     while(c<''||c>''){if(c=='-') neg=-;c=getchar();}

     while(c>=''&&c<='') x=x*+c-'',c=getchar();

     return x*neg;

 }

 int N,K,Ma,Mi,num[maxn];

 double sum[maxn];

 inline bool judge(int &x,int &y,double r){

     int a=-,b=N+;

     for(int i=;i<=N;i++) sum[i]=sum[i-]+num[i]-r;

     double mi=1e9;int mn;bool re=;

     for(int i=K;i<=N;i++){

         if(mi>=sum[i-K]) mi=sum[i-K],mn=i-K;

         if(sum[i]>=mi){

             re=;if(b-a>i-mn||(b-a==i-mn&&mn<a)) a=mn,b=i;

         }

     }if(re) x=a+,y=b;

     return re;

 }

 int main(){

     int i,j,k;

     N=rd();K=rd();Ma=-;Mi=;

     for(i=;i<=N;i++) num[i]=rd(),Ma=max(num[i],Ma),Mi=min(num[i],Mi);

     double l=Mi-,r=Ma+;int a,b;

     while(l<=r-1e-){

         double m=(l+r)/;

         if(judge(a,b,m)) l=m+1e-;

         else r=m-1e-;

     }printf("%d %d %.4f",a,b,l);

     return ;

 }