#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
// mt19937 g(chrono::high_resolution_clock::now().time_since_epoch().count());

int R, F, N;

const ld PI = atan(1.0) * 4.0;

vector<int> rad;
vector<ld> ang;

ld dist(ld x, ld y, ld a, ld r) {
    ld xx = r * cos(a);
    ld yy = r * sin(a);

    return (x - xx) * (x - xx) + (y - yy) * (y - yy);
}

ld solve(ld x, ld y, ld a) {
    int l = 0, r = (int)rad.size() - 1;
    ld ans = 1e18;
    while(l < r) {
        int m = (l + r) / 2;
        ld d1 = dist(x, y, a, rad[m]);
        ld d2 = dist(x, y, a, rad[m + 1]);
        ans = min({ans, d1, d2});
        if(d1 < d2) {
            r = m;
        } else {
            l = m + 1;
        }
    }
    ld d1 = dist(x, y, a, rad[r]);
    ans = min(ans, d1);
    return ans;
}

void solve_test() {
    cin >> R >> F >> N;
    rad = vector<int>(R);
    for(auto &x: rad)    cin >> x;
    sort(begin(rad), end(rad));

    for(int i = 0; i < F; i++) {
        int x, y;
        cin >> x >> y;
        ld a = atan2l(ld(y), ld(x));
        ang.push_back(a);
    }
    sort(begin(ang), end(ang));
    ld x = ang[0];
    ang.insert(begin(ang), ang.back() - PI * 2.0);
    ang.push_back(x + PI * 2.0);

    for(int i = 0; i < N; i++) {
        ld x, y;
        cin >> x >> y;
        ld a = atan2(y, x);

        auto it = lower_bound(begin(ang), end(ang), a);
        auto ans1 = solve(x, y, *it);
        it--;
        auto ans2 = solve(x, y, *it);
        auto ans = min(ans1, ans2);
        ans = sqrtl(ans);
        cout << fixed << setprecision(12) << ans << '\n';
    }

}

int main() {
#ifdef USEFOPEN
    freopen("1.in", "r", stdin);
    //freopen("1.out", "w", stdout);
#endif

    cin.sync_with_stdio(false); cin.tie(0);

    int T = 1;
//    scanf("%d", &T);
    for(int t = 1; t <= T; t++) {
        //printf("Case #%d: ", t);
        solve_test();
    }

    return 0;
}