13150

#include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define ZERO (1e-10)
#define INF (1<<29)
#define CL(A,I) (memset(A,I,sizeof(A)))
#define DEB printf("DEB!\n");
#define D(X) cout<<"  "<<#X": "<<X<<endl;
#define EQ(A,B) (A+ZERO>B&&A-ZERO<B)
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector<ii> vii;
#define IN(n) int n;scanf("%d",&n);
#define FOR(i, m, n) for (int i(m); i < n; i++)
#define REP(i, n) FOR(i, 0, n)
#define F(n) REP(i, n)
#define FF(n) REP(j, n)
#define FT(m, n) FOR(k, m, n)
#define aa first
#define bb second
void ga(int N,int *A){F(N)scanf("%d",A+i);}
#define MX (3000)
#define dd(AX,AY,BX,BY) ((AX-BX)*(AX-BX)+(BY-AY)*(BY-AY))
int N,Q,x[MX],y[MX],D[MX],O[MX],I,H;
ii R[MX];
void pr(int X,int Y,int J){
    H=0;
    FT(J+1,N)D[H++]=dd(X,Y,x[k],y[k]);
    sort(D,D+H),I=H;
    F(Q&&I){
        while(I&&D[I-1]>R[i].aa)--I;
        O[R[i].bb]+=I;
    }
}
int main(void){
    while(scanf("%d%d",&N,&Q),N){
        CL(O,0);
        F(N)scanf("%d%d",x+i,y+i);
        F(Q)scanf("%d",&R[i].aa),R[i].bb=i,R[i].aa*=R[i].aa;
        sort(R,R+Q,greater<ii>());
        F(N)pr(x[i],y[i],i);
        F(Q)printf("%.2lf\n",1+O[i]*2./N);
        puts("");
    }
    return 0;
}