#include <bits/stdc++.h>
using namespace std;
long long n, L, v1, v2;
long long _a[200001];
long long p[100001] = {
    0,
};
long long a(int i) { return _a[i]; }
void solve() {
  long long f = max(a(0) * (v1 + v2), a(1) * (v1 + v2) - v2 * L);
  for (int l = 1, r = 1; l <= n;) {
    long long F = min(a(r + 1) * (v1 + v2) - v2 * L, a(l) * (v1 + v2));
    if (F > f) {
      p[r - l + 1] += F - f;
      f = F;
    }
    if ((a(r + 1) - a(l)) * (v1 + v2) >= v2 * L)
      ++l;
    else
      ++r;
  }
}
int main() {
  cout.setf(ios::fixed);
  cout << setprecision(9);
  cin >> n >> L >> v1 >> v2;
  for (int _n = n, i = 0; i < _n; ++i) {
    cin >> _a[i];
    _a[i + n] = _a[i] + 2 * L;
  }
  _a[2 * n] = 4 * L + _a[0];
  solve();
  p[0] = 2 * (v1 + v2) * L;
  for (int i = (1), _b = (n); i <= _b; ++i) p[0] -= p[i];
  for (int i = (0), _b = (n); i <= _b; ++i)
    cout << p[i] / (2.0L * L * (v1 + v2)) << endl;
  return 0;
}
