#include<bits/stdc++.h>
using namespace std;
long long n,k,t,ans,maxl,l,xx,yy;
struct node{
	long long x,y,s;
}a[110000];
int main()
{
	cin>>n>>k>>t;
	for(int i=1;i<=n;i++){cin>>a[i].x>>a[i].y;a[i].s=1;}
	for(int i=n+1;i<=k+n;i++){cin>>a[i].x>>a[i].y;a[i].s=2;} 
	for(int i=1;i<=t;i++)
	{
		cin>>xx>>yy;maxl=0;
		for(int j=1;j<=k+n;j++)
			if(a[j].s!=0&&sqrt((xx-a[j].x)*(xx-a[j].x)+(yy-a[j].y)*(yy-a[j].y))>maxl) maxl=sqrt((xx-a[j].x)*(xx-a[j].x)+(yy-a[j].y)*(yy-a[j].y)),l=j;
		if(a[l].s==2) ans++;
	}
	cout<<ans;
	return 0;
}```