#include <bits/stdc++.h>
using namespace std;
const int MaxN = 110000;
double ans[MaxN];
double pos[MaxN * 2];
void calc(int n, double len, double l) {
  int ff = 0, rr;
  double st = 0, en = len;
  for (rr = 0; pos[rr] + 1e-9 < en; rr++)
    ;
  for (; st + 1e-9 < 2 * l;) {
    double dt = min(pos[rr] - en, pos[ff] - st);
    if (st + dt > 2 * l) dt = 2 * l - st;
    ans[rr - ff] += dt;
    if (pos[rr] - en < pos[ff] - st)
      rr++;
    else
      ff++;
    st += dt;
    en += dt;
  }
  for (int i = 0; i <= n; i++) printf("%.20lf\n", ans[i] / 2 / l);
}
int main() {
  int n;
  double l, v1, v2;
  cin >> n >> l >> v1 >> v2;
  for (int i = 0; i < n; i++) scanf("%lf", pos + i);
  for (int i = 0; i < n; i++) pos[i + n] = pos[i] + 2 * l;
  pos[2 * n] = (4 * l + 1e-7);
  calc(n, v2 / (v1 + v2) * l, l);
  return 0;
}
