#include <bits/stdc++.h>
using namespace std;
void solve();
int main() {
  ios_base::sync_with_stdio(0);
  int n = 1;
  for (int i = 0; i < n; ++i) solve();
}
long long buf[200005];
long double ver[100001];
long long *a = buf + 1;
void solve() {
  fill(ver, ver + 100001, 0);
  long long n, l, v1, v2;
  cin >> n >> l >> v1 >> v2;
  for (int i = 0; i < n; ++i) cin >> a[i];
  for (int i = n; i < 2 * n; ++i) a[i] = a[i - n] + 2 * l;
  a[2 * n] = 2147483647;
  a[-1] = a[n] - 2 * l;
  long double l1 = (long double)(v2 * l) / (long double)(v1 + v2);
  int b = 0, e = 1;
  long double c = a[0];
  while ((a[e] - a[b]) < l1) ++e;
  while (c < a[n]) {
    if ((long double)a[e] - c - l1 < (long double)a[b] - c) {
      ver[e - b] += ((long double)a[e] - c - l1) / (long double)(2 * l);
      c = (long double)a[e] - l1;
      while ((long double)a[b] < c) ++b;
      ++e;
    } else {
      ver[e - b] += ((long double)a[b] - c) / (long double)(2 * l);
      c = (long double)a[b];
      while ((long double)a[e] < c + l1) ++e;
      ++b;
    }
  }
  cout.precision(15);
  for (int i = 0; i <= n; ++i) cout << ver[i] << endl;
}
