#include <bits/stdc++.h>
using namespace std;
namespace std {
bool operator<(const complex<double> &a, const complex<double> &b) {
  return a.real() == b.real() ? a.imag() < b.imag() : a.real() < b.real();
}
}  // namespace std
const double EPS = 1e-9;
inline bool equal(double a, double b) { return abs(a - b) < EPS; }
istream &operator>>(istream &is, complex<double> &p) {
  double x, y;
  is >> x >> y;
  p = complex<double>(x, y);
  return is;
}
istream &operator>>(istream &is, pair<complex<double>, complex<double> > &l) {
  return is >> l.first >> l.second;
}
inline double cross(const complex<double> &a, const complex<double> &b) {
  return imag(conj(a) * b);
}
inline double dot(const complex<double> &a, const complex<double> &b) {
  return real(conj(a) * b);
}
inline complex<double> rotate(const complex<double> &a, double theta) {
  return a * polar(1.0, theta);
}
inline complex<double> direction(
    const pair<complex<double>, complex<double> > &line) {
  return line.second - line.first;
}
int ccw(const complex<double> &a, complex<double> b, complex<double> c) {
  b -= a;
  c -= a;
  if (cross(b, c) > +EPS) return 1;
  if (cross(b, c) < -EPS) return -1;
  if (dot(b, c) < -EPS) return 2;
  if (norm(b) < norm(c)) return -2;
  return 0;
}
int ccw(const pair<complex<double>, complex<double> > &l,
        const complex<double> &a) {
  return ccw(l.first, l.second, a);
}
pair<complex<double>, complex<double> > bisector(const complex<double> &a,
                                                 const complex<double> &b) {
  complex<double> v = rotate(b - a, M_PI / 2);
  complex<double> m = (a + b) * 0.5;
  return pair<complex<double>, complex<double> >(m, m + v);
};
complex<double> crosspoint(const pair<complex<double>, complex<double> > &l,
                           const pair<complex<double>, complex<double> > &m) {
  complex<double> l_vec = direction(l);
  complex<double> m_vec = direction(m);
  double A = cross(l_vec, m_vec);
  assert(!equal(A, 0));
  return m.first + cross(l_vec, l.second - m.first) / A * m_vec;
}
inline size_t next_index(const vector<complex<double> > &poly, size_t curr) {
  return (curr + 1) % poly.size();
}
inline size_t prev_index(const vector<complex<double> > &poly, size_t curr) {
  return (curr + poly.size() - 1) % poly.size();
}
vector<complex<double> > convex_cut(
    const vector<complex<double> > &poly,
    const pair<complex<double>, complex<double> > &line) {
  vector<complex<double> > new_poly;
  for (size_t i = 0; i < poly.size(); i++) {
    complex<double> a = poly[i];
    complex<double> b = poly[next_index(poly, i)];
    if (ccw(line, a) != -1) new_poly.push_back(a);
    if (ccw(line, a) * ccw(line, b) < 0) {
      new_poly.push_back(
          crosspoint(pair<complex<double>, complex<double> >(a, b), line));
    }
  }
  return new_poly;
}
double signed_area(const vector<complex<double> > &poly) {
  double res = 0;
  for (size_t i = 0; i < poly.size(); i++) {
    res += cross(poly[i], poly[next_index(poly, i)]);
  }
  return res * 0.5;
}
double area(const vector<complex<double> > &poly) {
  return abs(signed_area(poly));
}
int main() {
  ios::sync_with_stdio(false);
  int N, M;
  while (cin >> N >> M && N + M) {
    vector<complex<double> > poly(N);
    for (int i = (int)(0); i < (int)(N); i++) {
      cin >> poly[i];
    }
    vector<complex<double> > L(M);
    for (int i = (int)(0); i < (int)(M); i++) {
      cin >> L[i];
    }
    for (int i = (int)(0); i < (int)(M); i++) {
      vector<complex<double> > pi = poly;
      for (int j = (int)(0); j < (int)(M); j++)
        if (i != j) {
          pi = convex_cut(pi, bisector(L[i], L[j]));
        }
      cout << fixed << setprecision(20) << area(pi) << endl;
    }
  }
  return 0;
}
