#include <bits/stdc++.h>

using namespace std;

using ll = long long;
using db = long double;

const int mxn = 1e5 + 5;

struct Point
{
	int x, y;
	Point(): x(), y() {}
	Point(int _x, int _y): x(_x), y(_y) {}
	
	ll dot(const Point &oth) const
	{
		return 1LL * x * oth.x + 1LL * y * oth.y;
	}
	
	ll det(const Point &oth) const
	{
		return 1LL * x * oth.y - 1LL * y * oth.x;
	}
	
	int type() const
	{
		if (x >= 0 && y > 0) return 1;
		if (x < 0 && y >= 0) return 2;
		if (x <= 0 && y < 0) return 3;
		if (x > 0 && y <= 0) return 4;
		return 0;
	}
	
	friend ostream& operator << (ostream &o, const Point &p)
	{
		return o << "(" << p.x << ", " << p.y << ")";
	}
};

void chk(Point vec, db rad, Point p, db &res)
{
	db len = sqrt(1LL * vec.x * vec.x + 1LL * vec.y * vec.y);
	db x = vec.x / len, y = vec.y / len;
	x *= rad, y *= rad;
	res = min(res, sqrt((x - p.x) * (x - p.x) + (y - p.y) * (y - p.y)));
}

int R, F, n;
db r[mxn];
int fx[mxn], fy[mxn];
int qx[mxn], qy[mxn];
Point fp[mxn], qp[mxn];
int id[mxn], idq[mxn];

bool comp_angle(const Point &a, const Point &b)
{
	if (a.type() != b.type()) return a.type() < b.type();
	return a.det(b) > 0;
}

bool comp_query(int a, int b)
{
	return comp_angle(qp[a], qp[b]);
}

int sgn(ll x)
{
	return x < 0 ? -1 : x == 0 ? 0 : +1;
}

db ans[mxn];

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin >> R >> F >> n;
	for (int i = 0; i < R; ++ i) cin >> r[i];
	for (int i = 0; i < F; ++ i) cin >> fx[i] >> fy[i], fp[i] = Point(fx[i], fy[i]);
	sort(r, r + R);
	sort(fp, fp + F, comp_angle);
//	for (int i = 0; i < F; ++ i) cerr << fp[i] << " ";
//	cerr << endl;
	for (int i = 0; i < n; ++ i) cin >> qx[i] >> qy[i], qp[i] = Point(qx[i], qy[i]);
	iota(idq, idq + n, 0);
	sort(idq, idq + n, comp_query);
	int J = F - 1;
	for (int i = 0; i < n; ++ i)
	{
		int I = idq[i];
//		int J0 = (J + 1) % F;
//		if (F > 1) while (sgn(qp[I].det(fp[J])) * sgn(qp[I].det(fp[J0])) >= 0)
//		{
//			if (qp[I].det(fp[J]) == 0 && qp[I].dot(fp[J]) >= 0) break;
//			J = J0, J0 = (J + 1) % F;
//		}
		J = upper_bound(fp, fp + F, qp[I], comp_angle) - fp;
		J = (J + F - 1) % F;
//		cerr << qp[i] << "	-	" << fp[J] << " " << fp[J0] << endl;
		ans[I] = 1e18;
		for (int dt = -5; dt <= +5; ++ dt)
		{
			int J_ = ((J + dt) % F + F) % F;
			int T = lower_bound(r, r + R, (db)(qp[I].dot(fp[J_])) / sqrt((db)fp[J_].dot(fp[J_]))) - r;
			for (int k = -5; k <= +5; ++ k) if (T + k >= 0 && T + k < R) chk(fp[J_], r[T + k], qp[I], ans[I]);
		}
	}
	cout << fixed << setprecision(15);
//	cout << fixed << setprecision(6);
	for (int i = 0; i < n; ++ i) cout << ans[i] << endl;
	return 0;
}