#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
typedef long double D;
typedef pair<int, int> pii;
typedef long long LL;
const int N = 100011;
const D pi = acos((D)-1.);
struct P {
	D x, y;
	void scan() {
		double _x, _y;
		scanf("%lf%lf", &_x, &_y);
		x = _x; y = _y;
	}
	D atan2() const {
		return ::atan2(	y, x);
	}
	D sqrlen() const {
		return x * x + y * y;
	}
	D len() const {
		return sqrt(sqrlen());
	}
	P operator - (const P & b) const {
		return P{x - b.x, y - b.y};
	}
	P operator + (const P & b) const {
		return P{x + b.x, y + b.y};
	}
	D operator % (const P & b) const {
		return x * b.x + y * b.y;
	}
	D operator * (const P & b) const {
		return x * b.y - y * b.x;
	}
	void print() const {
		printf("%.12f %.12f\n", (double)x, (double)y);
	}
	P rev() const {
		return P{-y, x};
	}
};
P operator * (const D & x, const P & b) {
	return P{x * b.x, x * b.y};
}
struct L {
	P s, d;
};
P intersect(const L & a, const L & b) {
	D lambda = (b.s - a.s) * b.d / (a.d * b.d);
	return a.s + lambda * a.d;
}
int d[N];
D a[N];
int main() {
	int r, f, n;
	scanf("%d%d%d", &r, &f, &n);
	for(int i = 1; i <= r; i++) {
		scanf("%d", &d[i]);
	}
	sort(d + 1, d + r + 1);
	d[r + 1] = d[r];
	d[0] = d[1];
	for(int i = 1; i <= f; i++) {
		P x;
		x.scan();
		a[i] = x.atan2();
	}
	sort(a + 1, a + 1 + f);
	a[f + 1] = a[1] + 2 * pi;
	a[0] = a[f] - 2 * pi;
	for(int i = 0; i < n; i++) {
		P x;
		x.scan();
		D ang = x.atan2();
		D ans = 1e50;
		int k = lower_bound(a + 1, a + f + 1, ang) - a;
		for(int k1 = 0; k1 < 2; k1++) {
			P dir{cos(a[k - k1]), sin(a[k - k1])};
			P p = intersect({{0, 0}, dir}, {x, dir.rev()});
			D dis = p % dir;
			int j = lower_bound(d + 1, d + r + 1, dis) - d;
			for(int j1 = 0; j1 < 2; j1++) {
				P p{d[j - j1] * cos(a[k - k1]), d[j - j1] * sin(a[k - k1])};
				//p.print();
				//x.print();
				ans = min(ans, (p - x).len());
			}
		}
		printf("%.20f\n", (double)ans);
	}

}