#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


using Double = double;
constexpr Double INF = 1e+12;

int N, W, H;
vector<int> A;

// [x, x+1] * [0, y]
Double calc(int x, int y) {
  int a = A[x], b = A[x + 1];
  if (a > b) swap(a, b);
  Double ret;
  if (y < 0) {
    ret = 0.0;
  } else if (y < a) {
    ret = y;
  } else if (y < b) {
    const Double t = (b - y) / (Double)(b - a);
    ret = a + (b - a) / 2.0 * (1.0 - t*t);
  } else {
    ret = (a + b) / 2.0;
  }
// cerr<<"[calc] "<<x<<" "<<y<<" = "<<ret<<"; "<<a<<" "<<b<<endl;
  return ret;
}

Double area[230][1 << 10];
Double dp[230][230][1 << 9];

int main() {
  for (; ~scanf("%d%d%d", &N, &W, &H); ) {
    A.assign(N + 2, 0);
    for (int i = 1; i <= N; ++i) {
      scanf("%d", &A[i]);
    }
    
    memset(area, 0, sizeof(area));
    for (int i = 1; i <= N + 2*W; ++i) {
      // [x, x+1]
      const int x = i - W;
      if (0 <= x && x <= N) {
        for (int p = 0; p < 1 << (2*W); ++p) {
          vector<pair<int, int>> es;
          for (int j = 0; j < 2*W; ++j) if (p >> j & 1) {
            if (1 <= i - j && i - j <= N) {
              es.emplace_back(A[i - j] - H, +1);
              es.emplace_back(A[i - j] + H, -1);
            }
          }
          sort(es.begin(), es.end());
          int now = 0;
          for (int j = 0; j < (int)es.size() - 1; ++j) {
            now += es[j].second;
            if (now) {
              area[i][p] += (calc(x, es[j + 1].first) - calc(x, es[j].first));
            }
          }
        }
// cerr<<"area["<<i<<"] = ";pv(area[i],area[i]+(1<<(2*W)));
      }
    }
    
    const int mask = (1 << (2*W-1)) - 1;
    for (int i = 0; i <= N + 2*W; ++i) for (int k = 0; k <= N; ++k) {
      fill(dp[i][k], dp[i][k] + (1 << (2*W-1)), -INF);
    }
    dp[0][0][0] = 0.0;
    for (int i = 1; i <= N + 2*W; ++i) {
      for (int k = 0; k < i; ++k) for (int p = 0; p < 1 << (2*W-1); ++p) {
        for (int q = 0; q <= ((i <= N) ? 1 : 0); ++q) {
          chmax(dp[i][k + q][(p << 1 | q) & mask], dp[i - 1][k][p] + area[i][p << 1 | q]);
        }
      }
    }
    
    for (int k = 1; k <= N; ++k) {
      printf("%.12f\n", dp[N + 2*W][k][0]);
    }
  }
  return 0;
}