#include <bits/stdc++.h>
#define pb push_back
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define f first
#define s second
using namespace std;
using ll = long long;
using ld = long double;

template<class T> struct Point{
	T x, y;
	Point(T x = 0, T y = 0): x(x), y(y) {}
	using P = Point;
	P operator + (P p) const { return P(x + p.x, y + p.y); }
	P operator - (P p) const { return P(x - p.x, y - p.y); }
	P operator * (T d) const { return P(x * d, y * d); }
	P operator / (T d) const { return P(x / d, y / d); }
	bool side() const {
		if(y == 0) return x < 0;
		return y < 0;
	}
	T cross(P p) const { return x * p.y - y * p.x; }
	bool operator < (P p) const {
		if(side() == p.side()) return cross(p) > 0;
		return p.side();
	}
	T dot(P p) const { return x * p.x + y * p.y; }
	T dist2() const { return dot(*this); }
	ld dist() const { return sqrtl(dist2()); }
	P unit() const { return *this / dist(); }
};
using P = Point<ll>;
using Pld = Point<ld>;
const int N = 1e5;

int n, m, R[N];
P a[N];

ld solve(int pos, Pld p){
	Pld v{a[pos].x, a[pos].y};
	v = v.unit();
	int tl = -1, tr = n;
	while(tr - tl > 1){
		int tm = tl + tr >> 1;
		if((p - v * R[tm]).dot(v) < 0) tr = tm;
		else tl = tm;
	}
	ld res = 1e18;
	if(tl >= 0) res = min(res, (p - v * R[tl]).dist());
	if(tr < n) res = min(res, (p - v * R[tr]).dist());
	return res;
}

main() {
	ios :: sync_with_stdio(false);
	cin.tie(nullptr);
	int q;
	cin >> n >> m >> q;
	for(int i = 0; i < n; i++) cin >> R[i];
	sort(R, R + n);
	for(int i = 0; i < m; i++) cin >> a[i].x >> a[i].y;
	sort(a, a + m);
	for(P p; q--;){
		cin >> p.x >> p.y;
		int i = upper_bound(a, a + m, p) - a;
		ld ans = solve(i % m, Pld{p.x, p.y});
		i = (i + m - 1) % m;
		ans = min(ans, solve(i, Pld{p.x, p.y}));
		cout << fixed << setprecision(9) << ans << '\n';
	}
}