#include <bits/stdc++.h>
using namespace std;

#define FOR(i,a,b) for(auto i=a;i<b;++i)
#define F(a) FOR(i,0l,a)
#define FF(a) FOR(j,0l,a)
#define aa first
#define bb second
#define PB push_back
#define pb push_back
#define MOD ((int)1e9+7)
#define INF (1<<30)
#define LINF (1L<<61)
#define EPS (1e-10)
#define EQ(a,b) (fabs(a-b)<=(fabs(a+b)*EPS))
#ifdef DEBUG
#define DEB puts("DEB!")
#define DPRINT(X) printf("#X: %d\n",X)
#define dout cout
#else
#define DEB do{}while(0)
#define DPRINT(X) do{}while(0)
#define dout 0 && cout
#endif
using ll=long long;
using ull=unsigned long long;
using ld=double;
using vi=vector<int>;
using vvi=vector<vi>;
using pii=pair<int,int>;

#define MX 100007
ll uf[MX];
void init() { 
  F(MX) uf[i]=i; 
}
int find(int e) {
  return uf[e]==e ? e : uf[e]=find(uf[e]);
}
void mrg(int i, int j) {
  ll a=find(i), b=find(j);
  if(a>b) swap(a,b);
  uf[a]=b;
}

using St = pair<ld,int>;
ll N,F;
ll pipes[MX];
ld T[MX]; bitset<MX> done;

int main(){
  ios::sync_with_stdio(false);cout.tie(0);cin.tie(0);
  for(;;){
    init();
    if(scanf(" %lld %lld",&N,&F)!=2)break;
    priority_queue<St,vector<St>,greater<St>> q;
    done.reset();
    F(N){
      int c;scanf(" %d",&c);
      q.push({ld(c)/F,i});
      pipes[i]=1;
      T[i]=ld(c)/F;
    }
    ld last=0,lastev=0;
    while(q.size()) {
      auto cur=q.top(); q.pop();
      if(done[cur.bb]) continue;
//      cout<<cur.aa<<' '<<cur.bb<<endl;
      done[cur.bb]=1;
      lastev=cur.aa;
      if(cur.bb == N-1) last=cur.aa;
      else{
        mrg(cur.bb,cur.bb+1);
        int nx=find(cur.bb);
        if(nx!=cur.bb) {
          ld t=cur.aa, t2=T[nx];
          T[nx] = t2 - ld(t2-t)/pipes[nx] + ld(t2-t)/(pipes[nx]+pipes[cur.bb]);
          pipes[nx]+=pipes[cur.bb];
//          cout<<"next "<<nx<<" at "<<T[nx]<<endl;
          q.push({T[nx],nx});
        }
      }
    }
    cout<<fixed<<setprecision(15)<<last<<' '<<lastev<<endl;
  }

  return 0;
}