//Author: Kevin
#include<bits/stdc++.h>
//#pragma GCC optimize("O2")
using namespace std;
#define ll long long
#define ld long double
#define ull unsigned ll
#define pb emplace_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
#define srt(x) sort(ALL(x))
#define rev(x) reverse(ALL(x))
#define rsrt(x) sort(rALL(x))
#define sz(x) (int)(x.size())
#define inf 0x3f3f3f3f
#define pii pair<int,int>
#define lb(v,x) (int)(lower_bound(ALL(v),x)-v.begin())
#define ub(v,x) (int)(upper_bound(ALL(v),x)-v.begin())
#define uni(v) v.resize(unique(ALL(v))-v.begin())
#define longer __int128_t
void die(string S){puts(S.c_str());exit(0);}
const ld pi=acos(-1.0);
const ld eps=1e-14;
struct point
{
	ld x,y;
	point(ld _x=0,ld _y=0):x(_x),y(_y){}
	friend point operator +(const point &a,const point &b){return point(a.x+b.x,a.y+b.y);}
	friend point operator -(const point &a,const point &b){return point(a.x-b.x,a.y-b.y);}
	friend point operator *(const point &a,const ld &b){return point(a.x*b,a.y*b);}
	friend point operator /(const point &a,const ld &b){return point(a.x/b,a.y/b);}
	friend int operator !=(const point &a,const point &b){return fabs(a.x-b.x)>eps||fabs(a.y-b.y)>eps;}
};
ld area(point p1,point p2,point p3)
{
	point A=p2-p1;
	point B=p3-p1;
	return 0.5*fabs(A.y*B.x-A.x*B.y);
}
ld W;
int n;
point P[100100],P2[100100];
point C;
point O;
ld Angle[100100];
ld Angle2[100100];
int nxt[100100];
ld Ans[100100];
point IP[100100];
int vis[100100];
inline int ccw(point A,point B)
{
	return (A.x*B.y-A.y*B.x)<eps;
}
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cin>>n>>W;
	for(int i=1;i<=n;i++)
		cin>>P[i].x>>P[i].y;
	cin>>O.x>>O.y;
	for(int i=1;i<=n;i++)
		P[i]=P[i]-O;
	O.x=O.y=0;
	ld S=0;
	for(int i=3;i<=n;i++)
	{
		ld Scur=area(P[1],P[i-1],P[i]);
		point C1=(P[1]+P[i-1]+P[i])/3.0;
		C=C+C1*Scur;
		S+=Scur;
	}
	C=C/S;
	ld Scale=W/(W+S);
	for(int i=1;i<=n;i++)
		P2[i]=(P[i]-C)*Scale+C;
	for(int i=1;i<=n;i++)
		Angle[i]=atan2l(P[i].y,P[i].x);
	for(int i=1;i<=n;i++)
		Angle2[i]=atan2l(P2[i].y,P2[i].x);
	int Inside=1;
	for(int i=1;i<=n;i++)
	{
		ld diff=Angle2[i%n+1]-Angle2[i];
		if(diff<0) diff+=pi*2;
		if(diff>pi-eps)
			Inside=0;
	}
	for(int i=1;i<=n;i++)
		if(!(P2[i]!=O))
			Inside=0;
	// cerr<<C.x<<" "<<C.y<<endl;
	// for(int i=1;i<=n;i++)
	// 	cerr<<P[i].x<<" "<<P[i].y<<endl;
	// for(int i=1;i<=n;i++)
	// 	cerr<<P2[i].x<<" "<<P2[i].y<<endl;
	// cerr<<Inside<<endl;
	// Inside=0;
	if(Inside)
	{
		int p=-1;
		ld Cur=inf;
		for(int i=1;i<=n;i++)
		{
			ld Delta=Angle2[i]-Angle[1];
			if(Delta<0) Delta+=pi*2;
			if(Delta<Cur)
			{
				Cur=Delta;
				p=i;
			}
		}
		nxt[1]=p;
		for(int i=2;i<=n;i++)
		{
			while(true)
			{
				ld Delta=Angle2[p]-Angle[i];
				if(Delta<0) Delta+=pi*2;
				if(Delta>=pi) p=p%n+1;
				else break;
			}
			nxt[i]=p;
		}
		for(int i=1;i<=n;i++)
		{
			int lst=(nxt[i]==1)?n:(nxt[i]-1);
			// IP[i]=Intersection(Line(O,P[i]),Line(P2[nxt[i]],P2[lst]));
			point B=P2[nxt[i]];
			point A=P2[lst]-B;
			ld k2=(B.y*P[i].x-B.x*P[i].y)/(A.x*P[i].y-A.y*P[i].x);
			assert(k2>-eps&&k2<1+eps);
			IP[i]=A*k2+B;
		}
		for(int i=1;i<=n;i++)
		{
			if(nxt[i]==nxt[i%n+1])
				Ans[i]=area(O,IP[i],IP[i%n+1]);
			else
			{
				Ans[i]=area(O,IP[i],P2[nxt[i]]);
				int lst=nxt[i%n+1];
				lst=(lst==1)?n:(lst-1);
				Ans[i]+=area(O,IP[i%n+1],P2[lst]);
				int cur=nxt[i];
				while(cur!=lst)
				{
					Ans[i]+=area(O,P2[cur],P2[cur%n+1]);
					cur=cur%n+1;
				}
			}
		}
		ld totS=S*Scale*Scale;
		for(int i=1;i<=n;i++)
			assert(!isnan(Ans[i]));
		for(int i=1;i<=n;i++)
			printf("%.20Lf\n",Ans[i]/totS);
	}
	else
	{
		vector<ld> vangle;
		for(int i=1;i<=n;i++) if(P2[i]!=O)
			vangle.pb(Angle2[i]);
		srt(vangle);
		ld St=vangle[0];
		for(int i=1;i<sz(vangle);i++)
			if(vangle[i]-vangle[i-1]>pi-eps)
				St=vangle[i];
		ld Dis=inf;
		int stp=-1;
		for(int i=1;i<=n;i++)
		{
			ld diff=St-Angle[i];
			if(diff<0) diff+=pi*2;
			if(diff<Dis)
			{
				Dis=diff;
				stp=i;
			}
		}
		// for(int i=1;i<=n;i++)
		// 	cerr<<P2[i].x<<" "<<P2[i].y<<endl;
		// cerr<<endl;
		// for(int i=1;i<=n;i++)
		// 	cerr<<Angle[i]<<endl;
		// cerr<<endl;
		// for(int i=1;i<=n;i++)
		// 	cerr<<Angle2[i]<<endl;
		// cerr<<endl;
		// cerr<<St<<endl;
		// cerr<<stp<<endl;
		ld A=inf,B=-inf;
		int st1=-1,st2=-1;
		for(int i=1;i<=n;i++) if(P2[i]!=O)
		{
			ld diff=Angle2[i]-St;
			if(diff<0) diff+=pi*2;
			if(diff<A)
			{
				A=diff;
				st1=i;
			}
			if(diff>B)
			{
				B=diff;
				st2=i;
			}
		}
		// cerr<<st1<<" "<<st2<<endl;
		vector<point> vpL,vpR;
		for(int cur=st1;;cur=cur%n+1)
		{
			vpR.pb(P2[cur]);
			if(cur==st2) break;
		}
		for(int cur=st2;;cur=cur%n+1)
		{
			vpL.pb(P2[cur]);
			if(cur==st1) break;
		}
		rev(vpR);
		// {
			// cerr<<"vpL: ";
			// for(auto p:vpL)
			// 	cerr<<"("<<p.x<<","<<p.y<<") ";
			// cerr<<endl;
			// cerr<<"vpR: ";
			// for(auto p:vpR)
			// 	cerr<<"("<<p.x<<","<<p.y<<") ";
			// cerr<<endl;
		// }
		for(int i=stp;;i=i%n+1)
		{
			if(vis[i])
				break;
			// cerr<<"Calc "<<i<<endl;
			vis[i]=1;
			int i2=i%n+1;
			ld Ang=Angle[i2];
			point pL,pR;
			vector<point> delL,delR;
			int okk=1;
			while(ccw(P[i2],vpL.back()))
			{
				delL.pb(vpL.back());
				vpL.pop_back();
				if(sz(vpL)==0)
					break;
				// pL=Intersection(Line(O,P[i2]),Line(vpL.back(),delL.back()))
				point B=vpL.back();
				point A=delL.back()-B;
				ld k2=(B.y*P[i2].x-B.x*P[i2].y)/(A.x*P[i2].y-A.y*P[i2].x);
				// cerr<<P[i2].x<<" "<<P[i2].y<<endl;
				// cerr<<vpL.back().x<<" "<<vpL.back().y<<endl;
				// cerr<<delL.back().x<<" "<<delL.back().y<<endl;
				okk=1;
				if(!((k2>-eps&&k2<1+eps))) okk=0;
				// cerr<<k2<<endl;
				pL=A*k2+B;
			}
			if(sz(vpL)&&sz(delL))
			{
				vpL.pb(pL);
				delL.pb(pL);
			}
			while(ccw(P[i2],vpR.back()))
			{
				delR.pb(vpR.back());
				vpR.pop_back();
				if(sz(vpR)==0)
					break;
				// pR=Intersection(Line(O,P[i2]),Line(vpR.back(),delR.back()));
				point B=vpR.back();
				point A=delR.back()-B;
				ld k2=(B.y*P[i2].x-B.x*P[i2].y)/(A.x*P[i2].y-A.y*P[i2].x);
				// cerr<<P[i2].x<<" "<<P[i2].y<<endl;
				// cerr<<vpR.back().x<<" "<<vpR.back().y<<endl;
				// cerr<<delR.back().x<<" "<<delR.back().y<<endl;
				okk=1;
				if(!((k2>-eps&&k2<1+eps))) okk=0;
				// cerr<<k2<<endl;
				pR=A*k2+B;
			}
			if(sz(vpR)&&sz(delR))
			{
				vpR.pb(pR);
				delR.pb(pR);
			}
			// cerr<<stp<<" "<<i<<endl;
			if(sz(vpL)&&sz(vpR)&&!okk) assert(0);
			// cerr<<"delL: ";
			// for(auto p:delL)
			// 	cerr<<"("<<p.x<<","<<p.y<<") ";
			// cerr<<endl;
			// cerr<<"delR: ";
			// for(auto p:delR)
			// 	cerr<<"("<<p.x<<","<<p.y<<") ";
			// cerr<<endl;
			if(sz(delL)&&sz(delR))
			{
				for(int j=1;j<sz(delL);j++)
					Ans[i]+=area(delR[0],delL[j-1],delL[j]);
				for(int j=1;j<sz(delR);j++)
					Ans[i]+=area(delL.back(),delR[j-1],delR[j]);
			}
			if(!sz(vpL)&&!sz(vpR)) break;
		}
		ld totS=S*Scale*Scale;
		for(int i=1;i<=n;i++)
			assert(!isnan(Ans[i]));
		for(int i=1;i<=n;i++)
			printf("%.20Lf\n",Ans[i]/totS);
	}
	return 0;
}