#include <bits/stdc++.h>
using namespace std;
int arr[524288 * 2 - 1];
struct SEGTREE {
  void init() {
    fill(arr, arr + (524288 * 2 - 1), 0);
    return;
  }
  void add(int begin, int end, int index, int left, int right) {
    if (begin == end) return;
    if (begin <= left && right <= end) {
      arr[index]++;
      return;
    } else if (left >= end || right <= begin) {
      return;
    }
    add(begin, end, index * 2 + 1, left, (left + right) / 2);
    add(begin, end, index * 2 + 2, (left + right) / 2, right);
    return;
  }
  int get(int index) {
    int cur = index + 524288 - 1, ret = 0;
    ret += arr[cur];
    while (0 != cur) {
      cur = (cur - 1) / 2;
      ret += arr[cur];
    }
    return ret;
  }
};
int table[100000];
pair<double, double> nds[100000 * 2];
pair<int, int> seg[100000 * 2];
double comp[100000 * 4], amt[100000 + 1];
int main() {
  int n, l, v1, v2;
  scanf("%d%d%d%d", &n, &l, &v1, &v2);
  for (int i = 0; i < n; i++) {
    scanf("%d", table + i);
  }
  int tail = 0;
  double d = ((double)v2) * ((double)l) / ((double)(v1 + v2));
  for (int i = 0; i < n; i++) {
    if (((double)table[i]) < d) {
      nds[tail++] = make_pair(0.0l, ((double)table[i]));
      nds[tail++] = make_pair(((double)table[i]) - d + ((double)l) * 2.0l,
                              ((double)l) * 2.0l);
    } else {
      nds[tail++] = make_pair(((double)table[i]) - d, ((double)table[i]));
    }
  }
  int p = 0;
  for (int i = 0; i < tail; i++) {
    comp[p++] = nds[i].first;
    comp[p++] = nds[i].second;
  }
  sort(comp, comp + p);
  p = unique(comp, comp + p) - comp;
  for (int i = 0; i < tail; i++) {
    seg[i].first = lower_bound(comp, comp + p, nds[i].first) - comp;
    seg[i].second = lower_bound(comp, comp + p, nds[i].second) - comp;
  }
  SEGTREE tree;
  tree.init();
  for (int i = 0; i < tail; i++) {
    tree.add(seg[i].first, seg[i].second, 0, 0, 524288);
  }
  fill(amt, amt + (n + 1), 0.0l);
  for (int i = 0; i < p - 1; i++) {
    amt[tree.get(i)] += comp[i + 1] - comp[i];
  }
  amt[0] += comp[0];
  amt[0] += ((double)(l * 2)) - comp[p - 1];
  for (int i = 0; i <= n; i++) {
    printf("%.20lf\n", amt[i] / ((double)(l * 2)));
  }
  return 0;
}
