#include <bits/stdc++.h>
#define ff first
#define ss second
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAXN = 101010;

struct point {
	double x, y;
};
point operator-(point a, point b) { return {a.x - b.x, a.y - b.y}; }
point operator+(point a, point b) { return {a.x + b.x, a.y + b.y}; }
double operator*(point a, point b) { return a.x * b.x + a.y * b.y; }
double operator/(point a, point b) { return a.x * b.y - a.y * b.x; }
point operator*(double k, point a) { return {k * a.x, k * a.y}; }
point unit(point a) {
	double d = sqrtl(a * a);
	return {a.x / d, a.y / d};
}

int n, m, q;
double d[MAXN], e[MAXN];
int main() {
	cin.tie(0); ios_base::sync_with_stdio(0);
	cin >> n >> m >> q;
	for (int i = 0; i < n; i++) {
		cin >> d[i];
	}
	sort(d, d + n);
	for (int i = 0; i < n - 1; i++) {
		e[i] = (d[i] + d[i + 1]) / 2;
	}
	vector<pair<int, pair<int, int>>> points;
	for (int i = 0; i < m; i++) {
		int x, y; cin >> x >> y;
		points.push_back({0, {x, y}});
	}
	for (int i = 1; i <= q; i++) {
		int x, y; cin >> x >> y;
		points.push_back({i, {x, y}});
	}
	auto sgn = [&](pair<int, int> a) {
		return (a.second == 0 && a.first > 0) || a.second > 0;
	};
	sort(points.begin(), points.end(), [&](auto a, auto b) {
		bool b1 = sgn(a.second);
		bool b2 = sgn(b.second);
		if (b1 != b2)
			return b1;
		else {
			auto [x1, y1] = a.second;
			auto [x2, y2] = b.second;
			long long t = x1 * y2 - x2 * y1;
			return t > 0;
		}
	});
	int sz = m + q;
	int best = -1;
	vector<double> ans(q, 1e12);
	for (int i = 0; i < 2 * sz; i++) {
		if (points[i % sz].first == 0) {
			best = i;
			continue;
		}
		else {
			if (best == -1) continue;
			auto [x1, y1] = points[best % sz].second;
			point u = unit({x1, y1});
			auto [x2, y2] = points[i % sz].second;
			point v = {x2, y2};
			int t = points[i % sz].first - 1;
			double ds = u * v;
			int p = lower_bound(e, e + n - 1, ds) - e;
			if (p != 0) {
				ans[t] = min(ans[t], sqrt((v - (d[p - 1] * u)) * (v - (d[p - 1] * u))));
			}
			ans[t] = min(ans[t], sqrt((v - (d[p] * u)) * (v - (d[p] * u))));
		}
	}
	best = -1;
	for (int i = 2 * sz - 1; i >= 0; i--) {
		if (points[i % sz].first == 0) {
			best = i;
			continue;
		}
		else {
			if (best == -1) continue;
			auto [x1, y1] = points[best % sz].second;
			point u = unit({x1, y1});
			auto [x2, y2] = points[i % sz].second;
			point v = {x2, y2};
			int t = points[i % sz].first - 1;

			double ds = u * v;
			int p = lower_bound(e, e + n - 1, ds) - e;
			if (p != 0) {
				ans[t] = min(ans[t], sqrt((v - (d[p - 1] * u)) * (v - (d[p - 1] * u))));
			}
			ans[t] = min(ans[t], sqrt((v - (d[p] * u)) * (v - (d[p] * u))));
		}
	}
	cout.precision(10);
	for (int i = 0; i < q; i++) {
		cout << fixed << ans[i] << '\n';
	}
}