#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int N=1e5+100;
int r,f,n;
double d[N];
struct node{
	double x,y,ang;
	bool operator < (const node &oth)const{return ang<oth.ang;}
}p[N];
int Find(double ang){
	int st=1,ed=f;
	while(st<ed){
		int mid=(st+ed+1)>>1;
		if(p[mid].ang<ang) st=mid;
		else ed=mid-1;
	}
	return st;
}

double calcdis(int i,int j,double x,double y){
	double nx=d[j]/sqrt(p[i].x*p[i].x+p[i].y*p[i].y)*p[i].x,ny=d[j]/sqrt(p[i].x*p[i].x+p[i].y*p[i].y)*p[i].y;
	return sqrt((nx-x)*(nx-x)+(ny-y)*(ny-y));
}

double calc(int i,double nx,double ny){
	int st=1,ed=r;
	double ans=2e18;
	while(ed-st+1>=4){
		int w=(ed-st+1)/3,mid1=st+w,mid2=ed-w;
		if(calcdis(i,mid1,nx,ny)<calcdis(i,mid2,nx,ny)) ed=mid2;
		else st=mid1;
	}
	for(int j=st;j<=ed;j++) ans=min(ans,calcdis(i,j,nx,ny));
	return ans;
}

int main()
{
	scanf("%d%d%d",&r,&f,&n);
	for(int i=1;i<=r;i++) scanf("%lf",&d[i]);
	for(int i=1;i<=f;i++){
		scanf("%lf%lf",&p[i].x,&p[i].y);
		p[i].ang=atan2(p[i].y,p[i].x);
	}
	sort(d+1,d+1+r);
	sort(p+1,p+1+f);
	while(n--){
		double nx,ny;
		scanf("%lf%lf",&nx,&ny);
		double ang=atan2(ny,nx);
		int x=Find(ang);
		printf("%.12lf\n",min(calc(x,nx,ny),calc(x%f+1,nx,ny)));
	}
}