#include "bits/stdc++.h"

using namespace std;

#define ld long double
#define point pair<ld, ld>
#define x first
#define y second

point operator-(point a, point b) {
    return {a.x - b.x, a.y - b.y};
}

point operator*(point a, ld d) {
    return {a.x * d, a.y * d};
}

ld sq(point a) {
    return sqrtl(a.x * a.x + a.y * a.y);
}

ld sin(point a, point b) {
    return a.x * b.y - a.y * b.x;
}

int id(point a) {
    if (a.y > 0 || (a.y == 0 && a.x >= 0)) {
        return 0;
    }
    return 1;
}

bool cmp(point a, point b) {
    if (id(a) != id(b)) return id(a) < id(b);
    if (sin(a, b) == 0) return a < b;
    return sin(a, b) > 0;
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int R, n, q;
    cin >> R >> n >> q;
    vector<ld> r(R);
    for (auto& x : r) {
        cin >> x;
    }
    std::sort(r.begin(), r.end());
    vector<point> a(n);
    for (auto& x : a) {
        cin >> x.x >> x.y;
        x = x * (1 / (ld) sq(x));
    }
    std::sort(a.begin(), a.end(), cmp);
    while (q--) {
        point t;
        cin >> t.x >> t.y;
        ld ans = 1e18;
        int it = std::lower_bound(a.begin(), a.end(), t, cmp) - a.begin();
        for (int x = -10; x <= 10; x++) {
            int i = (it + x) % n;
            if (i < 0) i += n;
//                if (i == n - 1) {
//                    cout << a[i].x << " " << a[i].y << endl;
//                    cout << a[i].x * 4 << " " << a[i].y * 4 << endl;
//                }
//            ans = min(ans, sq(t - a[i] * r[j]));
            ld alpha = sin(a[i], t) / sq(a[i]) / sq(t);
            ld d = cos(alpha) * sq(t);
            int it2 = std::lower_bound(r.begin(), r.end(), d) - r.begin();
//        cout << d << "  " << it << endl;
//        for (int i = 0; i < R; i++) upd(i);
            if (it2 < r.size()) {
                ans = min(ans, sq(t - a[i] * r[it2]));
            }
            if (it2 + 1 < r.size()) {
                ans = min(ans, sq(t - a[i] * r[it2 + 1]));
            }
            if (it2) {
                ans = min(ans, sq(t - a[i] * r[it2 - 1]));
            }
        }
        cout << fixed << setprecision(15) << ans << '\n';
    }
}