#include<bits/stdc++.h>
using namespace std;
const int MAXN=1e5+10;
int read()
{
	int kkk=0,x=1;
	char c=getchar();
	while((c<'0' || c>'9') && c!='-') c=getchar();
	if(c=='-') c=getchar(),x=-1;
	while(c>='0' && c<='9') kkk=kkk*10+(c-'0'),c=getchar();
	return kkk*x;
}
int R,F,N,r[MAXN];
double p[MAXN];
double calc(int id,int rr,int x,int y)
{
	double xx=r[rr]*cos(p[id])-x;
	double yy=r[rr]*sin(p[id])-y;
	return sqrt(xx*xx+yy*yy);
}
double solve(int id,int x,int y)
{
	int l=1,r=R-1;
	double ans=min(calc(id,1,x,y),calc(id,R,x,y));
	//for(int i=1;i<=R;++i) ans=min(ans,calc(id,i,x,y));
	//return ans;
	while(l<=r)
	{
		int mid1=(l+r)/2;
		int mid2=mid1+1;
		double v1=calc(id,mid1,x,y);
		double v2=calc(id,mid2,x,y);
		ans=min(min(v1,v2),ans);
		if(l==r) break;
		if(v1<v2) r=mid1;
		else l=mid2;
	}
	return ans;
}
int main()
{
	R=read(),F=read(),N=read();
	for(int i=1;i<=R;++i) r[i]=read();
	sort(r+1,r+R+1);
	for(int i=1;i<=F;++i)
	{
		int x=read(),y=read();
		p[i]=atan2(y,x);
		//cerr<<"gan "<<p[i]<<endl;
	}
	sort(p+1,p+F+1);
	p[F+1]=p[1];
	p[0]=p[F];
	for(int i=1;i<=N;++i)
	{
		int x=read(),y=read();
		double theta=atan2(y,x);
		int l=1,r=F,mem=F+1;
		while(l<=r)
		{
			int mid=(l+r)/2;
			if(p[mid]>=theta) mem=mid,r=mid-1;
			else l=mid+1;
		}
		//cerr<<"??? "<<mem<<" "<<p[mem]<<" "<<p[mem-1]<<" "<<theta<<endl;
		//break;
		printf("%.10lf\n",min(solve(mem,x,y),solve(mem-1,x,y)));
	}
	return 0;
}