#include<bits/stdc++.h>
using std::cin, std::cout;

const int mod = 998244353;

const int N = 500005;
using db = __float128;
const db eps = 1e-11;
struct p2 {
	db x, y;
	db abs() const {
		return sqrt(x * x + y * y);
	}
	db arg() const {
		return atan2(y, x);
	}
};
p2 operator + (p2 x, p2 y) { return {x.x + y.x, x.y + y.y}; }
p2 operator - (p2 x, p2 y) { return {x.x - y.x, x.y - y.y}; }
db operator * (p2 x, p2 y) { return x.x * y.y - x.y * y.x; }
p2 operator * (p2 x, db y) { return {x.x * y, x.y * y}; }
p2 operator / (p2 x, db y) { return {x.x / y, x.y / y}; }
p2 r90(p2 x) {
	return {-x.y, x.x};
}
struct line : p2 {
	db z;
	line(p2 a, p2 b) : p2(r90(b - a)), z(a * b) {}
};

p2 operator & (line x, line y) {
	return p2{p2{x.z, x.y} * p2{y.z, y.y}, p2{x.x, x.z} * p2{y.x, y.z}} / -(p2(x) * p2(y));
}

db cross(p2 x, p2 y, p2 z) {
	return (y - x) * (z - x);
}
std::vector<p2> gethull(std::vector<p2> o) {
	const db eps = 1e-14;
	sort(o.begin(), o.end(), [&](p2 x, p2 y) {
		return fabs(x.x - y.x) < eps ? x.y < y.y : x.x < y.x;
	});
	o.erase(unique(o.begin(), o.end(), [&](p2 x, p2 y) {
		return fabs(x.x - y.x) < eps && fabs(x.y - y.y) < eps;
	}), o.end());
	std::vector<p2> s;
	for(int i = 0;i < (int) o.size();++i) {
		for(;s.size() >= 2 && cross(s.rbegin()[1], s.back(), o[i]) <= eps;) {
			s.pop_back();
		}
		s.push_back(o[i]);
	}
	for(int i = o.size() - 2, t = s.size();i >= 0;--i) {
		for(;s.size() > t && cross(s.rbegin()[1], s.back(), o[i]) <= eps;) {
			s.pop_back();
		}
		s.push_back(o[i]);
	}
	if(s.size() > 1) s.pop_back();
	return s;
}
db area(std::vector<p2> o) {
	db sum = 0;
	for(int i = 2;i < (int) o.size();++i) {
		sum += (o[i - 1] - o[0]) * (o[i] - o[0]);
	}
	return sum;
}
p2 med(std::vector<p2> o) {
	p2 sum = {};
	for(int i = 2;i < (int) o.size();++i) {
		db t = (o[i - 1] - o[0]) * (o[i] - o[0]);
		p2 z = (o[0] + o[i - 1] + o[i]) * (1. / 3);
		sum.x += z.x * t;
		sum.y += z.y * t;
	}
	sum = sum / area(o);
	return sum;
}
p2 get() {
	int x, y;
	cin >> x >> y;
	return {x, y};
}
int n, w;
std::vector<p2> ps[N];
using pr = std::pair<db, int>;
std::vector<pr> v;
const db pi = std::acos(-1);
int main() {
	std::ios::sync_with_stdio(false), cin.tie(0);
	cin >> n >> w;
	std::vector<p2> a(n);
	for(int i = 0;i < n;++i) {
		a[i] = get();
	}
	db V = area(a) / 2;
	auto b = a;
	p2 M = med(a);
	for(int i = 0;i < n;++i) {
		b[i] = (b[i] * w + M * V) / (w + V);
	}
	p2 o = get();
	for(int i = 1;i <= n;++i) {
		p2 p = a[i % n];
		db arg = (p - o).arg();
		v.emplace_back(arg, i % n);
		v.emplace_back(arg + pi * 2, i % n);
	}
	sort(v.begin(), v.end());
	int yes = 1;
	for(int i = 0;i < n;++i) {
		yes = yes && cross(o, b[i], b[(i + 1) % n]) >= -eps;
	}
	for(int i = 0;i < n;++i) {
		p2 u = b[i] - o;
		if(u.abs() > eps) {
			db arg = u.arg();
			auto iter = lower_bound(v.begin(), v.end(), pr(arg, 0));
			ps[iter -> second].push_back(u);
		} else {
			yes = 1;
		}
	}
	for(int i = 0;i < n;++i) {
		p2 u = b[i] - o, v = (b[(i + 1) % n] - o);
		if(u.abs() < eps || v.abs() < eps) {
			continue;
		}
		line l(u, v);
		db au = u.arg(), av = v.arg();
		if(au > av) std::swap(au, av);
		if(fabs(av - au - pi) < eps) {
			yes = 1;
		} else {
			if(av - au > pi) {
				au += pi * 2;
				std::swap(au, av);
			}
			if(fabs(au - av) < eps) {
				continue;
			}
			auto i0 = lower_bound(::v.begin(), ::v.end(), pr(au - eps, 0));
			auto i1 = lower_bound(::v.begin(), ::v.end(), pr(av + eps, 0));
			for(auto i = i0;i != i1;++i) {
				int id = i -> second;
				line tt(p2{0, 0}, a[id] - o);
				p2 t = tt & l;
				ps[id].push_back(t);
				ps[(id + 1) % n].push_back(t);
			}
		}
	}
	std::vector<db> ans(n);
	db sum = 0;
	for(int i = 0;i < n;++i) {
		if(yes) ps[i].push_back({0, 0});
		ps[i] = gethull(ps[i]);
		ans[i] = area(ps[i]);
		sum += ans[i];
	}
	for(int i = 1;i <= n;++i) {
		printf("%.10Lf\n", (long double)(ans[i % n] / sum));
	}

}