#include<bits/stdc++.h>
#define int long long
#define double long double
using namespace std;

int get() {
	int x = 0, f = 1; char c = getchar();
	while(!isdigit(c)) { if(c == '-') f = -1; c = getchar(); }
	while(isdigit(c)) { x = x * 10 + c - '0'; c = getchar(); }
	return x * f;
}

const int N = 1e5 + 5;
int nr, nf, n;
int _r[N];
struct Vector {
	double x, y;
	double arc() { return atan2(y, x); }
	friend bool operator <(Vector a, Vector b) { return a.arc() < b.arc(); }
	friend double operator *(Vector a, Vector b) { return a.x * b.x + a.y * b.y; }
	double len() { return sqrt(*this * *this); }
} _l[N];

double GetDis(Vector a, int id, double r) {
	double alen = _l[id].len();
	double x = _l[id].x / alen * r, y = _l[id].y / alen * r;
	return sqrt((a.x - x) * (a.x - x) + (a.y - y) * (a.y - y));
}

double GetMin(Vector a, int id) {
	double len = a * _l[id] / _l[id].len();
	int nxt = lower_bound(_r + 1, _r + 1 + nr, len) - _r;
	double ans = 1e18;
	if(nxt <= nr) ans = min(ans, GetDis(a, id, _r[nxt]));
	if(nxt > 1) ans = min(ans, GetDis(a, id, _r[nxt - 1]));
	return ans;
}

main() {
	nr = get(), nf = get(), n = get();
	for(int i = 1; i <= nr; i++) _r[i] = get();
	for(int i = 1; i <= nf; i++) _l[i].x = get(), _l[i].y = get();
	sort(_l + 1, _l + 1 + nf);
	_l[0] = _l[nf], _l[nf + 1] = _l[1];
	for(int i = 1; i <= n; i++) {
		Vector now;
		now.x = get(), now.y = get();
		int suf = lower_bound(_l + 1, _l + 1 + nf, now) - _l;
		double ans = 1e18;
		for(int i = -2; i <= 2; i++)
			ans = min(ans, GetMin(now, (suf + i + nf) % nf));
		printf("%.10Lf\n", ans);
	}
	return 0;
}