#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <string>
#include <algorithm>
#include <queue>
#include <set>
#include <map>
#include <cmath>
using namespace std;
typedef long long LL;
#define REP(_,a,b) for(int _ = (a); _ <= (b); _++)
const double eps = 1e-10;
const  int maxn = 1e6+10;
const double PI = acos(-1.0);
int n,m;
int len;
double ans[maxn];
struct Point{
    double x,y;
    bool flag;
    int id;
    Point (double x = 0,double y = 0,bool flag = false):x(x),y(y),flag(flag){}

};
typedef Point Vector;
double Cross(Vector A,Vector B) {return A.x*B.y-A.y*B.x;}
double Dot(Vector A,Vector B) {return A.x*B.x+A.y*B.y;}
double Length(Vector A) {return sqrt(Dot(A,A));}
double Angle(Vector A,Vector B) {return acos(Dot(A,B)/Length(A)/Length(B));}
Vector operator + (Vector A,Vector B) {
	return Vector(A.x+B.x,A.y+B.y);
}
Vector operator - (Vector A,Vector B){
	return Vector(A.x-B.x,A.y-B.y);
}
Vector operator * (Vector A,double p){
	return Vector(A.x*p,A.y*p);
}
Vector operator / (Vector A,double p){
	return Vector(A.x/p,A.y/p);
}
int dcmp(double x){
	if(fabs(x) < eps) return 0;
	else return x < 0? -1:1;
}
bool operator < (const Point &a,const Point &b){
	return dcmp(a.x-b.x) <0 || dcmp(a.x-b.x)==0&&dcmp(a.y-b.y)<0;
}

bool operator == (const Point &a,const Point &b){
	return dcmp(a.x-b.x)==0&& dcmp(a.y-b.y)==0;
}
bool cmp1(Point a,Point b) {
    return a.x < b.x;
}
bool cmp2(Point a,Point b) {
    return a.x > b.x;
}
Point P[maxn],ret[maxn];
void input() {
    memset(ans,0,sizeof ans);
    scanf("%d",&n);
    REP(i,0,n-1) {
        scanf("%lf%lf",&P[i].x,&P[i].y);
        P[i].flag = false;
    }
    scanf("%d",&m);
    len = n+m;
    REP(i,0,m-1) {
        double t;
        scanf("%lf",&t);
        P[i+n].x = t;
        P[i+n].y = 0;
        P[i+n].id = i;
        P[i+n].flag = true;
    }
    P[len].flag = false;
    P[len].x = 0;
    P[len++].y = 0;
    P[len].flag = false;
    P[len].x = 1e8;
    P[len++].y = 0;

}
void solve() {
    sort(P,P+len,cmp1);
    int  cur = 0;
    ret[0] = P[0];
    for(int i = 1; i < len; i++) {
        while(cur >= 1 && dcmp(Cross(ret[cur]-ret[cur-1],P[i]-ret[cur])) >= 0) {
            cur--;
        }
        if(P[i].flag) {
            ans[P[i].id] += Angle(P[i]-ret[cur],Vector(0,-1));
        }
        ret[++cur] = P[i];
    }
    sort(P,P+len,cmp2);
    ret[0] = P[0];
    cur = 0;
    for(int i = 1; i < len; i++) {
          while(cur>=1 && dcmp(Cross(ret[cur]-ret[cur-1],P[i]-ret[cur])) <=  0) {
            cur--;
        }
        if(P[i].flag) {
            ans[P[i].id] += Angle(ret[cur]-P[i],Vector(0,1));
        }
        ret[++cur] = P[i];
    }
    for(int i = 0; i  < m; i++) {
        printf("%.6lf\n",ans[i]/PI*180.0);
    }
}
int main(){
    int  ncase,T=1;
    cin >> ncase;
    while(ncase--) {
        input();
        printf("Case #%d:\n",T++);
        solve();
    }
    return 0;
}