#include<bits/stdc++.h>
using namespace std;
#define int long long
int read(){
	int f = 1,x = 0;
	char c = getchar();
	while(c > '9' || c < '0'){
		if(c == '-') f = -1;
		c = getchar();
	}
	while(c >= '0' && c <= '9'){
		x = x * 10 + c - '0';
		c = getchar();
	}
	return x * f;
}
int r,f,n;
const int maxn = 400015;
const double eps = 1e-9;
double a1[maxn];
double a2[maxn];
double pi = acos(-1);
double js(double x1,double x2,double x3,double x4){
	double x5 = x3 * cos(x4);
	double x6 = x3 * sin(x4);
	x1 = x1 - x5;
	x2 = x2 - x6;
	return sqrt(x1 * x1 + x2 * x2);
}
signed main()
{
	r = read(),f = read(),n = read();
	for(int i=1;i<=r;++i){
		int x = read();
		a1[i] = 1.0 * x;
	}
	sort(a1 + 1,a1 + r + 1);
	for(int i=1;i<=f;++i){
		int x = read(),y = read();
		if(x == 0){
			if(y > 0) a2[i] = pi/2;
			else a2[i] = -pi/2;
		}
		else
		{
			double qaq = 1.0 * y / x;
			if(x > 0) a2[i] = atan(qaq);
			else{
				if(y <= 0) a2[i] = atan(qaq) - pi;
				else a2[i] = atan(qaq) + pi;
			}
		}
	}
	for(int i=1;i<=f;++i) a2[i+f] = a2[i] + 2 * pi;
	for(int i=1;i<=f;++i) a2[i + 2 * f] = a2[i] - 2 * pi;
	sort(a2 + 1,a2 + 3 * f + 1);
	f = 3 * f;
//	for(int i=1;i<=f;++i) printf("%lf ",a2[i]);
	while(n != 0){
		--n;
		int x = read(),yyy = read();
		double x1 = 1.0 * x,y1 = 1.0 * yyy;
		double r1 = sqrt(x1 * x1 + y1 * y1);
		//l,l - 1
		double r2,r3;
		if(x == 0){
			if(yyy > 0) r2 = pi/2;
			else r2 = -pi/2;
		}
		else{
			r3 = 1.0 * y1 / x1;
			if(x > 0) r2 = atan(r3);
			else
			{
				if(yyy <= 0) r2 = atan(r3) - pi;
				else r2 = atan(r3) + pi;
			}
		}
		int zz = 1,yy = f;
		while(zz <= yy){
			int mid = (zz+yy)>>1;
			if(a2[mid] < r2) zz = mid + 1;
			else yy = mid - 1;
		}
		//l,l - 1
		double ans = 1e12;
		//printf("%lld %lld\n",z,z-1);
		for(int j=min(zz,f);j>=max(zz-1,1ll);--j){
			double rr1 = fabs(r1 * cos(r2 - a2[j]));
			int z = 1,y = r;
			while(z <= y){
				int mid = (z+y)>>1;
				if(a1[mid] < rr1) z = mid + 1;
				else y = mid - 1;
			}
		//	printf("%lf %lld %lf\n",a2[j],z,r2);
			for(int i=r;i>=1;--i){
				ans = min(ans,js(x1,y1,a1[i],a2[j]));
			}
			//printf("?");
		}
		/*for(int i=1;i<=r;++i){
			for(int j=1;j<=f/3;++j)
			ans = min(ans,js(x1,y1,a1[i],a2[j]));
		}*/
		printf("%.12lf\n",ans);
	}
}