Problem: Some of you know an old story of Voronoi Island. There were N liege lords and they are always involved in territorial disputes. The residents of the island were despaired of the disputes.

One day, a clever lord proposed to stop the disputes and divide the island fairly. His idea was to divide the island such that any piece of area belongs to the load of the nearest castle. The method is called Voronoi Division today.

Actually, there are many aspects of whether the method is fair. According to one historian, the clever lord suggested the method because he could gain broader area than other lords.

Your task is to write a program to calculate the size of the area each lord can gain. You may assume that Voronoi Island has a convex shape.



Input

The input consists of multiple datasets. Each dataset has the following format:

N M
Ix1 Iy1
Ix2 Iy2
...
IxN IyN
Cx1 Cy1
Cx2 Cy2
...
CxM CyM


N is the number of the vertices of Voronoi Island; M is the number of the liege lords; (Ixi, Iyi) denotes the coordinate of the i-th vertex; (Cxi, Cyi ) denotes the coordinate of the castle of the i-the lord.

The input meets the following constraints: 3 ≤ N ≤ 10, 2 ≤ M ≤ 10, -100 ≤ Ixi, Iyi, Cxi, Cyi ≤ 100. The vertices are given counterclockwise. All the coordinates are integers.

The last dataset is followed by a line containing two zeros. This line is not a part of any dataset and should not be processed.

Output

For each dataset, print the area gained by each liege lord with an absolute error of at most 10-4 . You may output any number of digits after the decimal point. The order of the output areas must match that of the lords in the input.

Example

Input

3 3
0 0
8 0
0 8
2 2
4 2
2 4
0 0


Output

9.0
11.5
11.5

Solution (in CPP):

Solution:
#include <iostream>
#include <iomanip>
#include <complex>
#include <vector>
#include <algorithm>
#include <cmath>
#include <array>
using namespace std;

const double EPS = 1e-8;
const double INF = 1e12;
#define EQ(n,m) (abs((n)-(m)) < EPS)
#define X real()
#define Y imag()

typedef complex<double> P;
typedef vector<P> VP;
struct L : array<P, 2>{
    L(const P& a, const P& b){ at(0)=a; at(1)=b; }
    L(){}
};
namespace std{
    bool operator < (const P& a, const P& b){
        return !EQ(a.X,b.X) ? a.X<b.X : a.Y<b.Y;
    }
    bool operator == (const P& a, const P& b){
        return abs(a-b) < EPS;
    }
}

double dot(P a, P b){
    return (conj(a)*b).X;
}
double cross(P a, P b){
    return (conj(a)*b).Y;
}
int ccw(P a, P b, P c){
    b -= a;
    c -= a;
    if(cross(b,c) > EPS) return +1; //ccw
    if(cross(b,c) < -EPS) return -1; //cw
    if(dot(b,c) < -EPS) return +2; //c-a-b
    if(abs(c)-abs(b) > EPS) return -2; //a-b-c
    return 0; //a-c-b
}

bool intersectSS(const L& a, const L& b){
    return ( ccw(a[0],a[1],b[0]) *ccw(a[0],a[1],b[1]) <= 0 ) &&
        ( ccw(b[0],b[1],a[0]) *ccw(b[0],b[1],a[1]) <= 0 );
}
bool intersectSP(const L& s, const P &p){
    return abs(cross(s[0]-p, s[1]-p))<EPS  && dot(s[0]-p, s[1]-p)<EPS;
}
P crosspointLL(const L &l, const L &m) {
  double A = cross(l[1]-l[0], m[1]-m[0]);
  double B = cross(l[1]-l[0], l[1]-m[0]);
  return m[0] + B/A *(m[1]-m[0]);
}

bool isParallel(const P &a, const P &b){
    return abs(cross(a,b)) < EPS;
}
bool isParallel(const L &a, const L &b){
    return isParallel(a[1]-a[0], b[1]-b[0]);
}

double getarea(const VP &poly){
    double ret = 0;
    for (int i=0; i<(int)poly.size(); i++){ 
        ret += cross(poly[i], poly[(i+1)%poly.size()]);
    }
    return ret*0.5;
}

int in_poly(const P &p, const VP &poly){
    int n = poly.size();
    int ret = -1;
    for(int i=0; i<n; i++){
        P a = poly[i]-p;
        P b = poly[(i+1)%n]-p;
        if(a.Y > b.Y) swap(a,b);
        if(intersectSP(L(a,b), P(0,0))) return 0;
        if(a.Y<=0 && b.Y>0 && cross(a,b)<0) ret = 1-ret;
    }
    return ret;
}

VP convex(VP v){
    VP ret;
    sort(v.begin(), v.end());
    v.erase(unique(v.begin(), v.end()), v.end());
    int n = v.size();
    for(int i=0; i<n; i++){
        while((int)ret.size()>1 && cross(ret.back()-ret[ret.size()-2], v[i]-ret.back()) < EPS){
            ret.pop_back();
        }
        ret.push_back(v[i]);
    }
    int t = ret.size();
    for(int i=n-2; i>=0; i--){
        while((int)ret.size()>t && cross(ret.back()-ret[ret.size()-2], v[i]-ret.back()) < EPS){
            ret.pop_back();
        }
        ret.push_back(v[i]);
    }
    if((int)ret.size() > 1) ret.pop_back();
    return ret;
}

VP convex_intersect(VP a, VP b){
	VP plist;
	int n=a.size(), m=b.size();
	for(int r=0; r<2; r++){
		for(int i=0; i<n; i++){
			if(in_poly(a[i], b) >= 0){
				plist.push_back(a[i]);
			}
		}
		swap(n, m);
		swap(a, b);
	}
	for(int i=0; i<n; i++){
		for(int j=0; j<m; j++){
			L la(a[i], a[(i+1)%n]), lb(b[j], b[(j+1)%m]);
			if(!isParallel(la, lb) && intersectSS(la, lb)){
				plist.push_back(crosspointLL(la, lb));
			}
		}
	}
	return convex(plist);
}

VP convex_cut(const VP& p, const L& l){
	VP ret;
	int n = p.size();
	for(int i=0; i<n; i++){
		P curr = p[i];
		P next = p[(i+1)%n];
		if(ccw(l[0], l[1], curr) != -1) ret.push_back(curr);
		if(ccw(l[0], l[1], curr) *ccw(l[0], l[1], next) == -1){
			ret.push_back(crosspointLL(L(curr, next), l));
		}
	}
	return ret;
}

vector<VP> volonoi_division(VP plist, VP poly){
	int n = poly.size(), m = plist.size();
	vector<VP> ret(m);
	for(int i=0; i<m; i++){
		VP v = poly;
		for(int j=0; j<m; j++){
			if(i==j) continue;
			P mid = (plist[i]+plist[j])/2.0;
			L bisector(mid, mid +(plist[j]-plist[i])*P(0,1));
			VP cut = convex_cut(v, bisector);
			v = convex_intersect(v, cut);
		}
		ret[i] = v;
	}
	return ret;
}

int main(){
	cout << fixed;
	cout << setprecision(10);
	while(1){
		int n,m;
		cin >> n >> m;
		if(n==0) break;
		
		int x,y;
		VP v(n), c(m);
		for(int i=0; i<n; i++){
			cin >> x >> y;
			v[i] = P(x, y);
		}
		for(int i=0; i<m; i++){
			cin >> x >> y;
			c[i] = P(x, y);
		}
		if(ccw(v[0], v[1], v[2]) != 1){
			reverse(v.begin(), v.end());
		}
		
		vector<VP> volonoi = volonoi_division(c, v);
		for(int i=0; i<m; i++){
			cout << getarea(volonoi[i]) << endl;
		}
	}
	return 0;
}