#include<iostream>
#include<cstdio>
#define N 4096
using namespace std;
int read()
{
    char c=0;
    int sum=0;
    while (c<'0'||c>'9') c=getchar();
    while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
    return sum;
}
int n,length,limit,x,a[N+1],num[N+1][N+1];
double dp[(N<<1)+1][N+1],dp2[(N<<1)+1][N+1];
int main()
{
    double res,rst;
    int A,B,C,l,r;
    n=read(),x=read();
    for (int i=1;i<=n-1;++i) a[i]=read();
    for (int i=0;;++i)
	if ((1<<i)==n)
	{
	    limit=i;
	    break;
	}
    for (int i=0;i<=limit;++i)
    {
	for (int j=1;j<=n;j+=(1<<i)) num[j][j+(1<<i)-1]=++length;
	if (!i)
	{
	    for (int j=1;j<=n;++j) dp[j][j]=dp2[j][j]=1;
	}
	else
	{
	    for (int j=1;j<=n;j+=(1<<i))
	    {
		A=num[j][j+(1<<i)-1],B=num[j][j+(1<<(i-1))-1],C=num[j+(1<<(i-1))][j+(1<<i)-1];
		for (int k=j;k<=j+(1<<(i-1))-1;++k)
		    for (int t=j+(1<<(i-1));t<=j+(1<<i)-1;++t)
		    {
			dp[A][k]+=dp[B][k]*dp[C][t]*a[k]/(a[k]+a[t]),dp[A][t]+=dp[B][k]*dp[C][t]*a[t]/(a[k]+a[t]);
			dp2[A][k]+=dp2[B][k]*dp2[C][t]*a[k-1]/(a[k-1]+a[t-1]),dp2[A][t]+=dp2[B][k]*dp2[C][t]*a[t-1]/(a[k-1]+a[t-1]);
		    }
	    }
	}
    }
    for (int i=0;i<n;++i)
    {
	rst=1;
	for (int j=0;j<=limit-1;++j)
	{
	    l=(((i>>j)<<j)^(1<<j))+1,r=((((i>>j)<<j)^(1<<j))|((1<<j)-1))+1,res=0;
	    if (i&(1<<j))
	    {
		for (int k=l;k<=r;++k) res+=dp[num[l][r]][k]*x/(x+a[k]);
	    }
	    else
	    {
		for (int k=l;k<=r;++k) res+=dp2[num[l][r]][k]*x/(x+a[k-1]);
	    }
	    rst*=res;
	}
	printf("%0.9lf\n",rst);
    }
    return 0;
}