#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <bits/stdc++.h>
#define LL long long
using namespace std;

#define L(i, s, t) for(int i = s; i <= t; ++i)
#define R(i, t, s) for(int i = t; i >= s; --i)

void read(int &x) {
    x = 0; int w = 1; char c = getchar(); for(; c < '0' || c > '9'; c = getchar()) if (c == '-') w = -1;
    for(; c <= '9' && c >= '0'; c = getchar()) x = x * 10 + c - '0'; x *= w;
}

const int N = 8200;

int n, x, a[N + 5], id[N + 5], b[N + 5];
vector<long double > f[N + 5], g[N + 5];
void build(int k, int l, int r, vector<long double> f[N + 5]) {
	if (l == r) {
		f[k].emplace_back(1);
		return;
	}
	int mid = l + r >> 1;
	build(k << 1, l, mid, f);
	build(k << 1 | 1, mid + 1, r, f);
	f[k].resize(r - l + 2);
	for(int i = 0; i < mid - l + 1; ++i) {
		f[k][i] = 0;
		for(int j = 0; j < r - mid; ++j) {
			f[k][i] += f[k << 1][i] * f[k << 1 | 1][j] * a[l + i] / (a[l + i] + a[mid + 1 + j]);
		}
	}

	for(int i = mid + 1 - l; i <= r - l; ++i) {
		f[k][i] = 0;
		for(int j = 0; j < mid - l + 1; ++j) {
			f[k][i] += f[k << 1][j] * f[k << 1 | 1][i - (mid + 1 - l)] * a[i + l] / (a[i + l] + a[l + j]);
		}
	}
}

int debug = 0;

long double query(int k, int l, int r, long double x, long double y) {
	if (l == r)
		return 1;
	int mid = l + r >> 1;
	long double ans = 0;
	if (x <= mid) {
		for(int i = 0; i < r - mid; ++i)
			ans = ans + g[k << 1 | 1][i] * y / (y + b[mid + i]);
		ans = ans * query(k << 1, l, mid, x, y);
	}	
	else {
		for(int i = 0; i <= mid - l; ++i)
			ans = ans + f[k << 1][i] * y / (y + b[l + i]);
		ans = ans * query(k << 1 | 1, mid + 1, r, x, y);
	}
	return ans;
}
int main() {
	// freopen("t.in", "r", stdin);
	read(n);  read(x);
	for(int i = 1; i < n; ++i)
		read(b[i]);
	for(int i = 1; i < n; ++i) a[i] = b[i]; a[n] = x;
	build(1, 1, n, f);
	for(int i = 1; i < n; ++i) a[i + 1] = b[i]; a[1] = x;
	build(1, 1, n, g);
	for(int i = 1; i <= n; ++i)
		printf("%.12Lf\n", query(1, 1, n, i, x));
    return 0;
}