#include <bits/stdc++.h>

using namespace std;

typedef long long int ll;
typedef double ld;

typedef pair<ll, ll> ii;
typedef vector<ll> vi;
typedef vector<ii> vii;

#define PB push_back
#define FOR(prom, a, b) for ( ll prom = (a); prom < (ll)(b); ++prom )
#define F(a) FOR(i,0,a)
#define FF(a) FOR(j,0,a)

#define EPS (1e-10)

struct Elem{
	ld time;
	ll idx;
	bool operator<(const Elem&e)const{
		return time>e.time;
	}
	friend ostream& operator<<(ostream & os, const Elem&e){
		os<<e.time<<' '<<e.idx<<endl;
		return os;
	}
};

#define INF (1ll<<61)

int main () {
	ios::sync_with_stdio(false);
	ll N;ld R;
	while(cin>>N>>R){
		vector<ll> a(N);
		F(N)cin>>a[i];
		priority_queue<Elem> q;
		F(N)q.push({(ld)a[i],i});
		ll tobe = N;
		ld all = INF, last = INF;
		vi done(N,0), next(N), cnt(N,1);
		F(N)next[i]=i+1;
		cout<<fixed<<setprecision(8);
		while(!q.empty()){
			Elem e=q.top();q.pop();
			//cout<<e;
			if(done[e.idx])continue;
			done[e.idx] = 1;
			if((--tobe) == 0){
				all = min(all,e.time);
			}
			ll nxt=next[e.idx];
			while(nxt!=N && done[nxt]){
				nxt=next[nxt];
			}
			//cout<<e.idx<<" -> "<<nxt<<endl;
			next[e.idx]=nxt;
			if(nxt == N) {
				last=min(last,e.time);
				continue;
			}
			cnt[nxt] += cnt[e.idx];
			q.push({e.time + (a[nxt]-(ld)e.time)/cnt[nxt], nxt});
		}
//		cout<<last<<' '<<all<<endl;
		cout<<last/R<<' '<<all/R<<endl;
	}
	
	return 0;
}