#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
using namespace std;
#define mk make_pair
#define MID int mid=(l+r)>>1;
#define ll long long
#define endl '\n'
#define siz(a) int(a.size())
int n,W,H;
int h[210];
double f[210][1024];
double dp[2][210][1024];
vector<pair<double,double>>x;
vector<pair<int,int>>now;
void solveclr(){

}
double len(int hh,int l,int r){
	if(hh<l)return 0;
	return min(hh,r)-l;
}
double calc(int l,int r,int id){
	if(r<l)return 0;
	// cout<<l<<' '<<r<<' '<<id<<endl;	
	l=max(l,0);
	x.clear();
	x.push_back(mk(id,len(h[id],l,r)));x.push_back(mk(id+1,len(h[id+1],l,r)));
	if(l<max(h[id],h[id+1])&&l>min(h[id],h[id+1])){
		double t=(l-h[id])/(double)(h[id+1]-h[id]);
		x.push_back(mk(id+t,len(l,l,r)));
	}
	if(r<max(h[id],h[id+1])&&r>min(h[id],h[id+1])){
		double t=(r-h[id])/(double)(h[id+1]-h[id]);

		x.push_back(mk(id+t,len(r,l,r)));
	}
	sort(x.begin(),x.end());
	double ans=0;
	for(int i=0;i+1<x.size();i++){
		auto t1=x[i],t2=x[i+1];
		ans+=(t2.first-t1.first)*(t2.second+t1.second)/2;
	}
	return ans;
}
double calc(vector<pair<int,int>>now,int id){
	sort(now.begin(),now.end());
	int l=0,r=-1;
	double res=0;
	for(auto tmp:now){
		if(r==-1){
			l=tmp.first,r=tmp.second;
		}
		else{
			if(r<tmp.first){
				res+=calc(l,r,id);
				l=tmp.first,r=tmp.second;
			}
			else{
				r=tmp.second;
			}
		}
	}
	res+=calc(l,r,id);
	return res;
}
void solve(){
	solveclr();
	cin>>n>>W>>H;
	for(int i=1;i<=n;i++){
		cin>>h[i];
	}
	h[0]=h[n+1]=0;
	for(int i=1;i<=n;i++){
		for(int s=0;s<1024;s++){
			for(int j=max(0,i-W);j<=min(i+W-1,n);j++){
				now.clear();
				int fl=0;
				for(int k=0;k<10;k++){
					if(!(s&(1<<k)))continue;
					int ls=i-k-1;
					if(ls<=0){
						fl=1;break;
					}
					if(ls-W<=j&&ls+W-1>=j){
						now.push_back(mk(h[ls]-H,h[ls]+H));
					}
				}
				if(fl){
					f[i][s]=-0x3f3f3f3f;break;
				}
				f[i][s]-=calc(now,j);
				now.push_back(mk(h[i]-H,h[i]+H));
				f[i][s]+=calc(now,j);
				// if(s==0){
				// 	cout<<i<<' '<<f[i][s]<<endl;
				// }
			}
		}
	}
	int d=0;
	for(int i=1;i<=n;i++){
		memset(dp[d^1],0,sizeof(dp[d^1]));
		for(int j=0;j<=n;j++){
			for(int s=0;s<1024;s++){
				dp[d^1][j][(s<<1)&1023]=max(dp[d^1][j][(s<<1)&1023],dp[d][j][s]);
				dp[d^1][j+1][(s<<1|1)&1023]=max(dp[d^1][j+1][(s<<1|1)&1023],dp[d][j][s]+f[i][s]);
			}
		}
		d^=1;
	}
	for(int j=1;j<=n;j++){
		double ans=0;
		for(int s=0;s<1024;s++)ans=max(ans,dp[d][j][s]);
		cout<<fixed<<setprecision(15)<<ans<<endl;
	}
}
int main(){
	// ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	int TTT;
	// cin>>TTT;
	TTT=1;
	while(TTT--)solve();
}
/*
5 1 2
100 1 100 1 100
*/