#include<bits/stdc++.h>
#define pi pair<int,int>
#define f first
#define s second
using namespace std;
const int N=200;
const double FI=-1e9;
int n,W,w2,H,h[N+10],sz;
double f[N+10][N+10][(1<<9)+10];
double ans,tmp;
pi a[15];
double Area(int l1,int l2,int lm){
    if(l1>l2)swap(l1,l2);
    if(lm<=0)return 0;
    if(lm<=l1)return lm;
    lm=min(lm,l2);
    return l1+(1.0+(l2-lm)/(1.0*l2-l1))*(lm-l1)/2.0;
}
double Calc(int x,int ms){
    if(x<0)return 0;
    double ret=0;
    sz=0;
    for(int i=0;i<=w2;++i)if(ms&(1<<i))a[++sz]=(pi){h[x+W-i]-H,h[x+W-i]+H};
    int tl=0,tr=0;
    sort(a+1,a+sz+1);
    for(int i=1;i<=sz;++i){
        if(a[i].f>tr){
            ret+=Area(h[x],h[x+1],tr)-Area(h[x],h[x+1],tl);
            tl=a[i].f,tr=a[i].s;
        }else tr=max(tr,a[i].s);
    }
    ret+=Area(h[x],h[x+1],tr)-Area(h[x],h[x+1],tl);
    return ret;
}
void Upd(double&x,double y){x=max(x,y);}
int main(){
    cin.sync_with_stdio(0),cin.tie(0);
    cin>>n>>W>>H;
    w2=(W<<1)-1;
    for(int i=1;i<=n;++i)cin>>h[i];
    for(int i=1;i<(1<<w2);++i)f[0][0][i]=FI;
    for(int i=1;i<=n;++i){
        for(int j=0;j<=i;++j)for(int k=0;k<(1<<w2);++k)f[i][j][k]=FI;
        for(int j=0;j<i;++j)for(int k=0;k<(1<<w2);++k)if(f[i-1][j][k]>=0){
            Upd(f[i][j][((k<<1)&((1<<w2)-1))],f[i-1][j][k]+Calc(i-W,k<<1));
            Upd(f[i][j+1][((k<<1|1)&((1<<w2)-1))],f[i-1][j][k]+Calc(i-W,k<<1|1));
        }
    }
    for(int i=1;i<=n;++i){
        ans=0;
        for(int j=0;j<(1<<w2);++j)if(f[n][i][j]>=0){
            tmp=f[n][i][j];
            for(int k=n-W+1,t=(j<<1);k<=n;++k,t=((t<<1)&((1<<w2+1)-1)))tmp+=Calc(k,t);
            ans=max(ans,tmp);
        }
        cout<<fixed<<setprecision(10)<<ans<<"\n";
    }
    return 0;
}