Red Huang

//  
//        GGGGGGGGGGGGG        CCCCCCCCCCCCC               AAA  
//     GGG::::::::::::G     CCC::::::::::::C              A:::A  
//   GG:::::::::::::::G   CC:::::::::::::::C             A:::::A  
//  G:::::GGGGGGGG::::G  C:::::CCCCCCCC::::C            A:::::::A  
// G:::::G       GGGGGG C:::::C       CCCCCC           A:::::::::A  
//G:::::G              C:::::C                        A:::::A:::::A  
//G:::::G              C:::::C                       A:::::A A:::::A  
//G:::::G    GGGGGGGGGGC:::::C                      A:::::A   A:::::A  
//G:::::G    G::::::::GC:::::C                     A:::::A     A:::::A  
//G:::::G    GGGGG::::GC:::::C                    A:::::AAAAAAAAA:::::A  
//G:::::G        G::::GC:::::C                   A:::::::::::::::::::::A  
// G:::::G       G::::G C:::::C       CCCCCC    A:::::AAAAAAAAAAAAA:::::A  
//  G:::::GGGGGGGG::::G  C:::::CCCCCCCC::::C   A:::::A             A:::::A  
//   GG:::::::::::::::G   CC:::::::::::::::C  A:::::A               A:::::A  
//     GGG::::::GGG:::G     CCC::::::::::::C A:::::A                 A:::::A  
//        GGGGGG   GGGG        CCCCCCCCCCCCCAAAAAAA                   AAAAAAA  
#include <iostream>  
#include <cstdio>  
#include <cstring>  
#include <algorithm>  
#include <cmath>  
#include <climits>  
#include <vector>  
#include <set>  
#include <map>  
#include <queue>  
#include <cctype>  
#include <utility>  
#include <ctime>  
using namespace std;  
#ifdef DEBUG  
#define debug(...) printf("DEBUG: "),printf(__VA_ARGS__)  
#define gettime() end_time=clock();printf("now running time is %.7f\\n",(float)(end_time - start_time)/CLOCKS_PER_SEC);  
#else  
#define debug(...)  
#define gettime()  
#endif  
typedef unsigned int uint;  
typedef long long int Int;  
#define Set(a,s) memset(a,s,sizeof(a))  
#define Write(w) freopen(w,"w",stdout)  
#define Read(r) freopen(r,"r",stdin)  
#define Pln() printf("\\n")  
#define I_de(x,n)for(int i=0;i<n;i++)printf("%d ",x[i]);Pln()  
#define De(x)printf(#x"%d\\n",x)  
#define For(i,x)for(int i=0;i<x;i++)  
#define CON(x,y) x##y  
#define Pmz(dp,nx,ny)for(int hty=0;hty<ny;hty++){for(int htx=0;htx<nx;htx++){\\  
    printf("%d ",dp[htx][hty]);}Pln();}  
#define M 205  
#define PII pair<int,int>  
#define PB push_back  
#define oo INT_MAX  
#define Set_oo 0x3f  
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)  
#define eps 1e-6  
#define poly vector<point>  
clock_t start_time=clock(), end_time;  
bool xdy(double x,double y){return x>y+eps;}  
bool xddy(double x,double y){return x>y-eps;}  
bool xcy(double x,double y){return x<y-eps;}  
bool xcdy(double x,double y){return x<y+eps;}  
int min3(int x,int y,int z){  
    int tmp=min(x,y);  
    return min(tmp,z);  
}  
int max3(int x,int y,int z){  
    int tmp=max(x,y);  
    return max(tmp,z);  
}  
struct point{  
    int x,y;  
    point(){  
        x=y=oo;  
    }  
    point(int x,int y):x(x),y(y){};  
    int product(point a, point b) {  
        return (this->x - a.x)*(b.y - a.y) - (this->y - a.y)*(b.x - a.x);  
    }  
    bool operator <(const point& p) const {  
        if (x == p.x) return y < p.y;  
        return x < p.x;  
    }  
    bool operator <=(const point& p) const {  
        if(this->x == p.x && this->y == p.y)return true;  
        if (x == p.x) return y < p.y;  
        return x < p.x;  
    }  
    bool operator ==(const point& p) const {  
        return (this->x == p.x && this->y == p.y);  
    }  
  
    bool insideSegment(point a, point b) {  
        return product(a, b) == 0 && min(a,b) < *this && *this < max(a,b);  
    }  
};  
  
int cross(point o,point a,point b){  
    return (a.x-o.x)*(b.y-o.y)-(a.y-o.y)*(b.x-o.x);  
}  
  
point p[M],r[M];  
int pn,rn,cn;  
point chp[M],chr[M];  
int chpn,chrn;  
int dist(point a,point b){  
    return (a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y);  
}  
bool cmp(point a,point b){  
    if(a.x==b.x)return a.y<b.y;  
    return a.x<b.x;  
}  
void monotone(point cp[],int &cpn,point x[],int n){  
    sort(x,x+n,cmp);  
    cpn=0;  
    for(int i=0;i<n;i++){  
        while(cpn>=2&&cross(cp[cpn-2],cp[cpn-1],x[i])<=0)cpn--;  
        cp[cpn++]=x[i];  
    }  
    for(int i=n-2,t=cpn+1;i>=0;i--){  
        while(cpn>=t&&cross(cp[cpn-2],cp[cpn-1],x[i])<=0)cpn--;  
        cp[cpn++]=x[i];  
    }  
    cpn--;  
}  
bool inPolygon(point p,point a[],int n){  
    for(int i=0;i<n;i++){  
        int j=(i+1)%n;  
//        debug("%d %d %d %d %d\\n",a[i].x,a[i].y,a[j].x,a[j].y,cross(p,a[i],a[j]));  
        if(cross(p,a[i],a[j])<=0)return false;  
    }  
    return true;  
}  
bool PointIsInside(point p,point a[],int n){  
    for(int i=0;i<n;i++){  
        int j=(i+1)%n;  
        if(p==a[i]||p.insideSegment(a[i],a[j]))return true;  
    }  
    return inPolygon(p,a,n);  
}  
void solve(){  
    monotone(chp,chpn,p,pn);  
    monotone(chr,chrn,r,rn);  
    for(int i=0;i<cn;i++){  
        int x,y;  
        scanf("%d%d",&x,&y);  
        point p=point(x,y);  
        bool inP=PointIsInside(p,chp,chpn)&&pn>=3;  
        bool inR=PointIsInside(p,chr,chrn)&&rn>=3;  
//        printf("%d\\n",chrn);  
        if(inP){  
            printf("     Citizen at (%d,%d) is safe.\\n",x,y);  
        }else if(inR){  
            printf("     Citizen at (%d,%d) is robbed.\\n",x,y);  
        }else{  
            printf("     Citizen at (%d,%d) is neither.\\n",x,y);  
        }  
    }  
}  
int main() {  
    ios_base::sync_with_stdio(0);  
    int ff=0;  
    while(~scanf("%d%d%d",&pn,&rn,&cn)&&pn+cn+rn){  
        for(int i=0;i<pn;i++){  
            int x,y;  
            scanf("%d%d",&x,&y);  
            p[i]=point(x,y);  
        }  
        for(int i=0;i<rn;i++){  
            int x,y;  
            scanf("%d%d",&x,&y);  
            r[i]=point(x,y);  
        }  
        printf("Data set %d:\\n",++ff);  
        solve();  
        Pln();  
    }  
}