1 #include <iostream>
 2 #include <cstdio>
 3 #include <cstring>
 4 #include <string>
 5 #include <algorithm>
 6 #include <cmath>
 7 #include <vector>
 8 #include <queue>
 9 #include <map>
10 #include <stack>
11 #include <set>
12 using namespace std;
13 typedef long long LL;
14 typedef unsigned long long uLL;
15 #define ms(a, b) memset(a, b, sizeof(a))
16 #define pb push_back
17 #define mp make_pair
18 #define eps 0.0000000001
19 #define IOS ios::sync_with_stdio(0);cin.tie(0);
20 const LL INF = 0x3f3f3f3f3f3f3f3f;
21 const int inf = 0x3f3f3f3f;
22 const int mod = 1e9+7;
23 const int maxn = 3000+10;
24 int x[maxn], y[maxn];
25 int dis[maxn*maxn];
26 int n, q, r;
27 int cul(int i, int j)
28 {
29     return (y[j]-y[i])*(y[j]-y[i])+(x[j]-x[i])*(x[j]-x[i]);
30 }
31 void solve()
32 {
33     int cnt = 0;
34     for(int i = 0;i<n;i++)  scanf("%d%d", &x[i], &y[i]);
35     for(int i = 0;i+1<n;i++){
36         for(int j = i+1;j<n;j++){
37             dis[cnt++] = cul(i, j);
38         }
39     }
40     sort(dis, dis+cnt);
41     int ans;
42     while(q--){
43         scanf("%d", &r);
44         int pos = upper_bound(dis, dis+cnt, r*r) - dis;
45         ans = 0;
46         ans += 2*pos;
47         ans += n;
48         printf("%.2f\n", (double)ans/(double)n);
49     }
50     printf("\n");
51 }
52 int main() {
53 #ifdef LOCAL
54     freopen("input.txt", "r", stdin);
55 //        freopen("output.txt", "w", stdout);
56 #endif
57 //    IOS
58     while(~scanf("%d%d", &n, &q)&&n+q){
59         solve();
60     }
61     return 0;
62 }