//#define LOCAL
#include <bits/stdc++.h>
#include <cassert>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,fma")
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
#define MAX 1010101
#define MAXQ 101010
#define INF 1'000'000'100
#define bb ' '
#define ln '\n'
#define Ln '\n'
#define MOD 1000000007
#define TC 1
#ifdef LOCAL
#define DEBUG(a) cout<<a
#else
#define DEBUG(...) 1234
#endif
ll disv[MAX];
pll f[MAX];
pll q[MAX];
pll rq[MAX];
ll ccw(pll p1, pll p2, pll p3) {
	return (p1.first * p2.second + p2.first * p3.second + p3.first * p1.second) - (p2.first * p1.second + p3.first * p2.second + p1.first * p3.second);
}
typedef long double ld;
ld ans[MAX];
inline ll sq(ll x) { return x * x; }
inline ld sq(ld x) { return x * x; }
ld getd(ld x1, ld y1, ld x2, ld y2) {
	return sqrt(sq(x1 - x2) + sq(y1 - y2));
}
ld getd(int fn, int qn, ll d) {
	DEBUG('f' << fn << 'q' << qn << 'd' << d << ln);
	pll fp = f[fn];
	ld fd = sqrt(sq(fp.first) + sq(fp.second));
	ld fx, fy;
	fx = (ld)fp.first / fd * d;
	fy = (ld)fp.second / fd * d;
	DEBUG("fxy" << fx << bb << fy << ln);
	ld res = getd(fx, fy, q[qn].first, q[qn].second);
	DEBUG(res << ln);
	return res;
}
signed main() {
	ios::sync_with_stdio(false), cin.tie(0);
	cout << fixed;
	cout.precision(20);
	int R, F, N;
	cin >> R >> F >> N;
	int i;
	for (i = 1; i <= R; i++) cin >> disv[i];
	sort(disv + 1, disv + R + 1);
	vector<int> v;
	auto ref = [&](pll& p) {
		ll g = gcd(abs(p.first), abs(p.second));
		if (!g) return;
		p.first /= g;
		p.second /= g;
	};
	for (i = 1; i <= F; i++) {
		cin >> f[i].first >> f[i].second;
		ref(f[i]);
		v.push_back(i);
	}
	for (i = 1; i <= N; i++) {
		cin >> q[i].first >> q[i].second;
		if (!q[i].first && !q[i].second) {
			ans[i] = disv[1];
			continue;
		}
		rq[i] = q[i];
		ref(q[i]);
		v.push_back(-i);
		ans[i] = 1e18;
	}
	auto getflag = [&](pll& p) {
		if (p.first > 0 && p.second >= 0) return 0;
		if (p.first <= 0 && p.second > 0) return 1;
		if (p.first < 0 && p.second <= 0) return 2;
		if (p.first >= 0 && p.second < 0) return 3;
	};
	sort(v.begin(), v.end(), [&](int i, int j) {
		pll p1, p2;
		if (i > 0) p1 = f[i];
		else p1 = q[-i];
		if (j > 0) p2 = f[j];
		else p2 = q[-j];
		if (p1 == p2) return false;
		int f1, f2;
		f1 = getflag(p1);
		f2 = getflag(p2);
		if (f1 != f2) return f1 < f2;
		ll x = ccw(pll(0, 0), p1, p2);
		if (!x) {
			DEBUG("fuck\n");
			DEBUG(p1.first << bb << p1.second << ln);
			DEBUG(p2.first << bb << p2.second << ln);
		}
		assert(x);
		return ccw(pll(0, 0), p1, p2) >= 0;
		});
	for (i = 1; i <= N; i++) swap(rq[i], q[i]);
	int s = 0;
	for (i = 0; i < v.size(); i++) {
		if (v[i] > 0) {
			s = i;
			break;
		}
	}
	vector<int> nv;
	for (i = s; i < v.size(); i++) nv.push_back(v[i]);
	for (i = 0; i < s; i++) nv.push_back(v[i]);
	v = nv;
	v.push_back(v[0]);
	int pv = 0;

	DEBUG("asdf");
	for (i = 0; i < v.size(); i++) DEBUG(v[i] << bb);
	DEBUG(ln);

	for (i = 0; i < v.size(); i++) {
		if (v[i] > 0) {
			pv = v[i];
			continue;
		}
		int qn = -v[i];
		int l, r;
		l = 1;
		r = R;
		while (r - l > 5) {
			int m = l + r >> 1;
			ld r1, r2;
			r1 = getd(pv, qn, disv[m]);
			r2 = getd(pv, qn, disv[m + 1]);
			if (r1 < r2) r = m + 1;
			else l = m;
		}
		for (int j = l; j <= r; j++) ans[qn] = min(ans[qn], getd(pv, qn, disv[j]));
	}
	for (i = v.size() - 1; i >= 0; i--) {
		if (v[i] > 0) {
			pv = v[i];
			continue;
		}
		int qn = -v[i];
		int l, r;
		l = 1;
		r = R;
		while (r - l > 5) {
			int m = l + r >> 1;
			ld r1, r2;
			r1 = getd(pv, qn, disv[m]);
			r2 = getd(pv, qn, disv[m + 1]);
			if (r1 < r2) r = m + 1;
			else l = m;
		}
		for (int j = l; j <= r; j++) ans[qn] = min(ans[qn], getd(pv, qn, disv[j]));
	}
	for (i = 1; i <= N; i++) cout << ans[i] << ln;
}