#include <bits/stdc++.h>
using namespace std;
int n;
long double l, ll;
vector<pair<long double, int> > a;
int fst;
const long double eps = 1e-9;
void Load() {
  cin >> n;
  int v1, v2;
  cin >> ll >> v1 >> v2;
  l = ll * v2 / (long double)(v1 + v2);
  int i;
  for (i = 0; i < n; i++) {
    int p;
    scanf("%d", &p);
    if (p + eps < l) fst++;
    a.push_back(make_pair((long double)p, -1));
    long double aa = p - l;
    if (aa < -eps) aa += 2 * ll;
    a.push_back(make_pair(aa, 1));
  }
  sort(a.begin(), a.end());
  a.push_back(a[0]);
  a.back().first += 2 * ll;
}
void Solve() {
  vector<long double> p(n + 1);
  int cur = fst;
  long double all = 0.0;
  int i;
  for (i = 0; i + 1 < a.size(); i++) {
    long double len = a[i + 1].first - a[i].first;
    cur += a[i].second;
    p[cur] += len;
    all += len;
  }
  cout.setf(ios::fixed | ios::showpoint);
  cout.precision(12);
  for (i = 0; i <= n; i++) {
    p[i] /= all;
    cout << p[i] << "\n";
  }
}
int main() {
  Load();
  Solve();
  return 0;
}
