#include <cstdio>
#include <algorithm>
#include <utility>
#include <cmath>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
constexpr int MAXN = 1e5+5;

struct Angle {
	int x, y;
	short quad;
	
	Angle() {}
	
	Angle(int x, int y) {
		this->x = x;
		this->y = y;
		quad = 0 | (x < 0);
		if(y < 0)
			quad ^= 3;
	}
	
	Angle(int x, int y, short quad) {
		this->x = x;
		this->y = y;
		this->quad = quad;
	}
	
	bool operator<(const Angle &o) const {
		if(quad == o.quad)
			return ll(x) * o.y - ll(y) * o.x > 0;
		return quad < o.quad;
	}
};

int D;
int dist[MAXN];
Angle angles[MAXN];

double distance2(double x, double y) {
	return x * x + y * y;
}

double point_dist(const pii &p, const pii &angle, const int d) {
	const double k = double(d) / sqrt(distance2(angle.first, angle.second));
	return distance2(angle.first * k - p.first, angle.second * k - p.second);
}

double get_min_dist(const pii &p, const pii &a) {
	// double ans = point_dist(p, a, dist[D-1]);
	int l = -1, r = D-1;
	while(l != r-1) {
		int m = (l+r)/2;
		const double md0 = point_dist(p, a, dist[m]);
		const double md1 = point_dist(p, a, dist[m+1]);
		if(md0 > md1)
			l = m;
		else
			r = m;
	}
	return sqrt(point_dist(p, a, dist[r]));
}

int main() {
	int D, A, N;
	scanf("%d %d %d", &D, &A, &N);
	::D = D;
	for(int i=0; i<D; i++)
		scanf("%d", dist+i);
	sort(dist, dist+D);
	for(int i=0, x, y; i<A; i++) {
		scanf("%d %d", &x, &y);
		angles[i] = Angle(x, y);
	}
	sort(angles, angles+A);
	angles[A] = Angle(angles[0].x, angles[0].y, 42);
	//for(int i=0; i<=A; i++)
	//	fprintf(stderr, "A: %d %d %d\n", angles[i].x, angles[i].y, angles[i].quad);
	

	for(int i=0, x, y; i<N; i++) {
		scanf("%d %d", &x, &y);
		const Angle atmp(x, y);
		const Angle *p = upper_bound(angles, angles+A+1, atmp);
		const double ans1 = get_min_dist({x, y}, {p->x, p->y});
		if(p == angles)
			p = &angles[A-1];
		else
			p--;
		const double ans2 = get_min_dist({x, y}, {p->x, p->y});
		printf("%.12lf\n", min(ans1, ans2));
	}
}