#include<bits/stdc++.h>
using namespace std;
struct Point {
	double x,y;
	Point() {}
	Point(double _x,double _y) {x=_x;y=_y;}
	Point operator +(const Point &a)const {return Point(x+a.x,y+a.y);}
	Point operator -(const Point &a)const {return Point(x-a.x,y-a.y);}
	Point operator *(const double &a)const {return Point(x*a,y*a);}
	double operator *(const Point &a)const {return x*a.x+y*a.y;}
	double operator ^(const Point &a)const {return x*a.y-y*a.x;}
	Point operator /(const double &a)const {return Point(x/a,y/a);}
	void print() {
		printf("(%.3lf %.3lf)\n",x,y);
	}
};
inline double dis(Point a,Point b){
	return sqrt((a-b)*(a-b));
}
const double eps=1e-9;
bool isupper(const Point &a) {
	if(abs(a.y)<eps) {
		if(a.x>-eps) return 1;
		return 0;
	}
	return a.y>0;
}
bool cmp(const Point &a,const Point &b) {
	bool fa=isupper(a),fb=isupper(b);
	if(fa!=fb) return fa>fb;
	return (a^b)>0;
}
const int maxn=100100;
int R,r[maxn],F;
Point f[maxn];
int N;
inline Point getpoint(int pos,double rad) {
	return f[pos]/sqrt(f[pos]*f[pos])*rad;
}
inline double getdis(Point a,int pos) {
	double ans=dis(a,getpoint(pos,r[1]));
	//getpoint(pos,r[1]).print();
	int fl=1,fr=R;
	while(fl<=fr) {
		int mid=(fl+fr)>>1;
		double disa=dis(a,getpoint(pos,r[mid]));
		double disb=dis(a,getpoint(pos,r[mid]+0.00001));
		ans=min(ans,disa);
		if(disa>disb) fl=mid+1;
		else fr=mid-1;
		//cout<<mid<<' ';
	}
	//printf("%.10f\n",ans);
	return ans;
}
int main() {
	scanf("%d%d%d",&R,&F,&N);
	for(int i=1;i<=R;i++) scanf("%d",r+i);
	sort(r+1,r+R+1);
	for(int i=1;i<=F;i++) scanf("%lf%lf",&f[i].x,&f[i].y);
	sort(f+1,f+F+1,cmp);
/*	for(int i=1;i<=F;i++) {
		printf("(%.2lf,%.2lf)\n",f[i].x,f[i].y);
	}*/
	while(N--) {
		Point Q;
		scanf("%lf%lf",&Q.x,&Q.y);
		int pos=lower_bound(f+1,f+F+1,Q,cmp)-f;
		int tpos=pos>F?1:pos;
		double ans=getdis(Q,tpos);
		//cout<<tpos<<endl;
		tpos=pos==1?F:pos-1;
		ans=min(ans,getdis(Q,tpos));
		//cout<<tpos<<endl;
		printf("%.10lf\n",ans);
	}
	return 0;
}

/*
3 7 1
2
4
7
8 4
2 8
-1 5
-7 2
-4 -4
1 -8
6 -3
8 1
*/