#include<bits/stdc++.h>
using namespace std;
struct Mimaji{
	int x;
	int y;
	bool flag;
};
int b(int a,int b,int x,int y){
	return sqrt((a.x-x)*(a.x-x)+(b.y-y)*(b.y-y));
}
int main(){
	int n;
	int k;
	int T;
	Mimaji a[10001];
	cin>>n>>k>>T;
	for(int i=1;i<=n;i++){
		cin>>a[i].x>>a[i].y;
	}
	for(int i=1;i<=k;i++){
		int x,y;
		cin>>x>>y;
		if(a[i].x==x && a[i].y==y){
			a[i].flag=true;
		}
	}
	for(int i=1;i<=t;i++){
		int x,y;
		cin>>x>>y;
		double max=-1;
		int ans=0;
		for(int j=1;j<=n;++j){
			if(b(a[i].x,a[i].y,x,y,)>max){
				ans=j;
				max=b(x,y,a[j].x,a[j].y);
			}
		}
		if(a[ans].flag){
			cnt++;
		}
	}
	cout<<cnt<<endl;
	return 0;
}

我也觉得没错啊