#include <bits/stdc++.h>
using namespace std;
const int N = 100010;
const long double eps = 1e-8;
int n;
long double q[N * 3];
long double ans[N];
int get(long double first) {
  int l = 1, r = n * 3;
  while (l < r) {
    int mid = l + r >> 1;
    if (q[mid] > first + eps)
      r = mid;
    else
      l = mid + 1;
  }
  return r;
}
int cal(long double first, long double second) {
  int a = get(first), b = get(second);
  return b - a;
}
int main() {
  int l, v1, v2;
  cin >> n >> l >> v1 >> v2;
  long double len = l * 1.0l * v2 / (v1 + v2);
  for (int i = 1; i <= n; i++)
    cin >> q[i], q[n + i] = q[i] + l * 2.0l, q[n * 2 + i] = q[i] + l * 4.0l;
  long double st = 0, ed = len;
  while (st < 2.0l * l - eps) {
    long double d1 = q[get(st)] - st, d2 = q[get(ed)] - ed;
    d1 = min(d1, d2), d1 = min(d1, 2.0l * l - st);
    ans[cal(st, ed)] += d1;
    st += d1, ed += d1;
  }
  for (int i = 0; i <= n; i++) printf("%.20lf\n", (double)(ans[i] / l / 2.0l));
  return 0;
}
