#include <bits/stdc++.h>
using namespace std;
const long double eps = 1e-15;
const int maxn = 100005;
long double ans[maxn];
int n;
long double l, v1, v2;
long double t, s;
pair<long double, int> ev[maxn * 2];
int esz = 0;
int main() {
  cin >> n >> l >> v1 >> v2;
  s = l * v1 / (v1 + v2);
  t = (l - s) / v1;
  long double period = 2. * l / v1;
  int startbal = 0;
  for (int i = 0; i < n; ++i) {
    long double a;
    cin >> a;
    long double start = -a / v1;
    long double final = start + t;
    if (start < -eps) start += period;
    if (final < -eps) final += period;
    ev[esz++] = make_pair(start, 1);
    ev[esz++] = make_pair(final, -1);
    if (final < start) startbal++;
  }
  ev[esz++] = make_pair(-eps, 0);
  ev[esz++] = make_pair(period, 0);
  sort(ev, ev + esz);
  int bal = startbal;
  for (int i = 1; i < esz; ++i) {
    ans[bal] += ev[i].first - ev[i - 1].first;
    bal += ev[i].second;
  }
  cout.precision(12);
  for (int i = 0; i <= n; ++i) cout << ans[i] / period << endl;
  return 0;
}
